pith. sign in

arxiv: 1804.10191 · v3 · pith:G6UE4JIEnew · submitted 2018-04-26 · 🧮 math.PR · math-ph· math.MP

Percolation on hyperbolic graphs

classification 🧮 math.PR math-phmath.MP
keywords graphpercolationcriticalexponentsgraphshyperbolicmean-fieldadditional
0
0 comments X
read the original 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 $p_c<p_u$ for any such graph. Our proof also yields that the triangle condition $\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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.