Metraipolis › archive › dc_67a66bcde642
Seed thresholds and degree variance in heterogeneous bootstrap percolation with growing degrees — arXiv:2610.04420
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.04420
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T13:47:37.132Z
- SHA-256 of the archived text
df12f4f8e16ccdd109aa097728e27fdf6347839e5f7afb670bf352e979cdcbce- Stable URL of this page
https://metraipolis.com/documento/dc_67a66bcde642
How to cite
Seed thresholds and degree variance in heterogeneous bootstrap percolation with growing degrees — arXiv:2610.04420 — arXiv (en), https://arxiv.org/abs/2610.04420 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_67a66bcde642 (Metraipolis archive dc_67a66bcde642, sha256 df12f4f8e16ccdd109aa097728e27fdf6347839e5f7afb670bf352e979cdcbce)
BibTeX
@misc{dc67a66bcde642,
title = {Seed thresholds and degree variance in heterogeneous bootstrap percolation with growing degrees — arXiv:2610.04420},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.04420},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_67a66bcde642; sha256 df12f4f8e16ccdd109aa097728e27fdf6347839e5f7afb670bf352e979cdcbce},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.04420. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study bootstrap percolation with independent vertex thresholds taking values one and two, with threshold-one probability $(1-c/d)/d$ for fixed $c>0$. The seed set is chosen uniformly among sets of a prescribed deterministic size, independently of the graph and thresholds. We prove threshold statements at fixed relative margins. For uniform simple graphs with prescribed nonnegative integer degrees of even sum and exact mean $d$, assume $\max_i|d_i-d|\le C\sqrt d$ and $c+1-v_n\ge\kappa>0$, where $v_n=\operatorname{Var}(D)/d$ and $C,\kappa$ are fixed. When $d\to\infty$ and $d=o(n^{1/7})$, the leading seed scale is $n(c+1-v_n)^2/(2d^4)$, without requiring a limit of $v_n$. At fixed relative margins below and above this scale, the final active set has size $O(n/d^3)$ and $n-o(n)$, respectively, with high probability. A separate result for $G(n,d/n)$ holds when $d\to\infty$ and $d^5/n\to0$, and gives scale $nc^2/(2d^4)$. Thus regular and independent-edge graphs have different coefficients at the same asymptotic mean degree. Local exploration estimates yield explicit inactive remainders and survive conditioning on simplicity in the prescribed model. We also quantify the precision obstruction to static inclusion transfer and compute deterministic response-barrier corrections, without identifying a shrinking random critical window.
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.04420 — 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-10-06T12:06:32.114Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).