English

Percolation on hyperbolic graphs

Probability 2019-03-27 v3 Mathematical Physics math.MP

Abstract

We prove that Bernoulli bond percolation on any nonamenable, Gromov hyperbolic, quasi-transitive graph has a phase in which there are infinitely many infinite clusters, verifying a well-known conjecture of Benjamini and Schramm (1996) under the additional assumption of hyperbolicity. In other words, we show that pc<pup_c<p_u for any such graph. Our proof also yields that the triangle condition pc<\nabla_{p_c}<\infty holds at criticality on any such graph, which is known to imply that several critical exponents exist and take their mean-field values. This gives the first family of examples of one-ended groups all of whose Cayley graphs are proven to have mean-field critical exponents for percolation.

Keywords

Cite

@article{arxiv.1804.10191,
  title  = {Percolation on hyperbolic graphs},
  author = {Tom Hutchcroft},
  journal= {arXiv preprint arXiv:1804.10191},
  year   = {2019}
}

Comments

40 pages, 8 figures. V2: Several minor revisions. Material on exponential decay of the two-point function has been removed and will reappear in the forthcoming companion paper "The L^2 boundedness condition in nonamenable percolation". V3: Metadata changed for bureaucratic reasons; no change to the text. Accepted version, to appear in GAFA

R2 v1 2026-06-23T01:37:17.928Z