Metraipolis › archive › dc_c4db0ecf065d

Locality of Bernoulli Site Percolation on Transitive Graphs — arXiv:2609.07026

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.07026
License (as archived)
CC0-1.0
Archived
2026-10-16T14:32:28.058Z
SHA-256 of the archived text
1bdfee4773bdca0e9d7ffc8a6547b87be269ff39fed646a741df91cfa3b36cb6
Stable URL of this page
https://metraipolis.com/documento/dc_c4db0ecf065d

How to cite

Locality of Bernoulli Site Percolation on Transitive Graphs — arXiv:2609.07026 — arXiv (en), https://arxiv.org/abs/2609.07026 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c4db0ecf065d (Metraipolis archive dc_c4db0ecf065d, sha256 1bdfee4773bdca0e9d7ffc8a6547b87be269ff39fed646a741df91cfa3b36cb6)
BibTeX
@misc{dcc4db0ecf065d,
  title = {Locality of Bernoulli Site Percolation on Transitive Graphs — arXiv:2609.07026},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.07026},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c4db0ecf065d; sha256 1bdfee4773bdca0e9d7ffc8a6547b87be269ff39fed646a741df91cfa3b36cb6},
  year = {2026}
}

Archived text

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

We prove locality of the critical probability for Bernoulli site percolation on infinite, connected, locally finite, vertex-transitive graphs, under the usual assumption that the critical probabilities stay uniformly below one. The proof develops site-percolation forms of the two-ghost inequality, sharp-threshold and snowballing estimates, and the nonunimodular height method. We also establish the plentiful-tube geometry needed for the multiscale argument from quantitative structure and random-walk estimates.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.07026 — 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-16T14:09:59.759Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).