Metraipolis › archive › dc_8adea1d34c4e

Supercritical level-set percolation on finite graphs — arXiv:2611.05299

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05299
License (as archived)
CC0-1.0
Archived
2026-11-04T12:47:22.502Z
SHA-256 of the archived text
cc8387a00eb200981613db2c43607b96c1615f349731cddf8fe7dadd98532006
Stable URL of this page
https://metraipolis.com/documento/dc_8adea1d34c4e

How to cite

Supercritical level-set percolation on finite graphs — arXiv:2611.05299 — arXiv (en), https://arxiv.org/abs/2611.05299 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8adea1d34c4e (Metraipolis archive dc_8adea1d34c4e, sha256 cc8387a00eb200981613db2c43607b96c1615f349731cddf8fe7dadd98532006)
BibTeX
@misc{dc8adea1d34c4e,
  title = {Supercritical level-set percolation on finite graphs — arXiv:2611.05299},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05299},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8adea1d34c4e; sha256 cc8387a00eb200981613db2c43607b96c1615f349731cddf8fe7dadd98532006},
  year = {2026}
}

Archived text

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

We continue the study of bond percolation on finite graphs induced by the level-sets of the zero-average Gaussian free field on the associated metric graph. In our previous work Goswami and Pal (2026), we analyzed the critical and near-critical behavior of this model on uniform expanders, focusing on the volume of the largest cluster. In the present paper, we investigate the size of the second largest cluster in the supercritical regime --- the phase where one expects a unique giant component. We prove that the second largest cluster is at most of logarithmic order with high probability. The estimates hold uniformly over deterministic graphs with a bounded maximum degree and a spectral gap bounded away from zero. In particular, we do not require any assumption regarding regularity, girth or local geometry. This picture is substantially different from Bernoulli percolation, where the second largest supercritical cluster can have polynomial volume under identical hypotheses. The proof relies on expansion properties of the underlying graph and the Dirichlet martingale framework developed in Goswami and Pal (2026).

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/2611.05299 — 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-04T12:32:02.022Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).