Metraipolis › archive › dc_719dcf32c8f2

Finite-size ignition laws near a vanishing branching deficit on near-regular simple graphs — arXiv:2610.38912

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.38912
License (as archived)
CC0-1.0
Archived
2026-11-01T02:34:13.986Z
SHA-256 of the archived text
f09b65f170bca9ac9fb0164fa5ade67fbf78903c96c74133249250b24c1fab13
Stable URL of this page
https://metraipolis.com/documento/dc_719dcf32c8f2

How to cite

Finite-size ignition laws near a vanishing branching deficit on near-regular simple graphs — arXiv:2610.38912 — arXiv (en), https://arxiv.org/abs/2610.38912 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_719dcf32c8f2 (Metraipolis archive dc_719dcf32c8f2, sha256 f09b65f170bca9ac9fb0164fa5ade67fbf78903c96c74133249250b24c1fab13)
BibTeX
@misc{dc719dcf32c8f2,
  title = {Finite-size ignition laws near a vanishing branching deficit on near-regular simple graphs — arXiv:2610.38912},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.38912},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_719dcf32c8f2; sha256 f09b65f170bca9ac9fb0164fa5ade67fbf78903c96c74133249250b24c1fab13},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38912. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study heterogeneous bootstrap percolation on uniform simple graphs with prescribed degrees of mean $d\to\infty$ and deviations at most $C\sqrt d$. Thresholds are independently one with probability $(1-c/d)/d$ and two otherwise; seeds form an independent uniform set of prescribed size $a$. Let $T_a$ be the terminal number of active vertices and $b$ be one minus the mean number of threshold-one descendants of a reached vertex. Let $K\sim d^2$ be the quadratic response coefficient. If $b>0$ and $nb^3/K\to\infty$, we prove, uniformly over seed counts $a$, $ \mathbb{P}(T_a\ge n/2)=\Phi(\frac{a-n\alpha_{\mathrm{det}}}{w})+o(1)$ with $w=\sqrt{nb/K}$, where $\alpha_{\mathrm{det}}$ is the exact empirical response-barrier center and $\Phi$ is the standard normal distribution function. Put $a_0=(n/K)^{1/3}$. If $d^4/n\to0$, $a/a_0\to x>0$ and $\lambda=ba_0\to\ell\in\mathbb{R}$, then $\mathbb{P}(T_a\ge n/2)\to p(x,\ell)$, the one-sided Brownian parabolic survival probability. A sequential absolute-error law joins these regimes. A graphical counterexample shows that replacing the exact center by its leading term can cause limiting probability error $1/2$. The proof balances adaptive early-exploration transfer against late concentration at a tunable physical horizon, despite exponentially rare simplicity. We also prove quantitative and mesoscopic-seed refinements in explicitly narrower regimes. The only external graph-enumeration input is a stated reduction of McKay--Wormald's estimate; the probabilistic estimates for the cascade argument are proved in the text and appendices.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.38912 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:14:58.628Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).