English

The critical percolation probability is local

Probability 2023-10-18 v1

Abstract

We prove Schramm's locality conjecture for Bernoulli bond percolation on transitive graphs: If (Gn)n1(G_n)_{n\geq 1} is a sequence of infinite vertex-transitive graphs converging locally to a vertex-transitive graph GG and pc(Gn)1p_c(G_n) \neq 1 for every n1n \geq 1 then limnpc(Gn)=pc(G)\lim_{n\to\infty} p_c(G_n)=p_c(G). Equivalently, the critical probability pcp_c defines a continuous function on the space G\mathcal{G}^* of infinite vertex-transitive graphs that are not one-dimensional. As a corollary of the proof, we obtain a new proof that pc(G)<1p_c(G)<1 for every infinite vertex-transitive graph that is not one-dimensional.

Keywords

Cite

@article{arxiv.2310.10983,
  title  = {The critical percolation probability is local},
  author = {Philip Easo and Tom Hutchcroft},
  journal= {arXiv preprint arXiv:2310.10983},
  year   = {2023}
}

Comments

87 pages, 6 figures

R2 v1 2026-06-28T12:52:54.188Z