Percolation on Hyperbolic Graphs
Percolation on Hyperbolic Graphs
复制标题
双曲图上的渗滤
DOI:
10.1007/s00039-019-00498-0
复制
发表时间:
2018
影响因子:
2.2
通讯作者:
Tom Hutchcroft
中科院分区:
文献类型:
--
作者:
Tom Hutchcroft
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$$pc<pu for any such graph. Our proof also yields that the triangle condition $$\nabla _{p_c}<\infty $$∇pc<∞ 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.
DOI:
10.48550/arxiv.1612.08693
发表时间:
2016
期刊:
arXiv e-prints
影响因子:
--
作者:
Angel Omer
通讯作者:
Angel Omer