Author:
Hermon Jonathan,Hutchcroft Tom
Abstract
AbstractLet G be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on G. We prove that if G is nonamenable and $$p > p_c(G)$$
p
>
p
c
(
G
)
then there exists a positive constant $$c_p$$
c
p
such that
$$\begin{aligned} \mathbf {P}_p(n \le |K| < \infty ) \le e^{-c_p n} \end{aligned}$$
P
p
(
n
≤
|
K
|
<
∞
)
≤
e
-
c
p
n
for every $$n\ge 1$$
n
≥
1
, where K is the cluster of the origin. We deduce the following two corollaries:
Every infinite cluster in supercritical percolation on a transitive nonamenable graph has anchored expansion almost surely. This answers positively a question of Benjamini et al. (in: Random walks and discrete potential theory (Cortona, 1997), symposium on mathematics, XXXIX, Cambridge University Press, Cambridge, pp 56–84, 1999).
For transitive nonamenable graphs, various observables including the percolation probability, the truncated susceptibility, and the truncated two-point function are analytic functions of p throughout the supercritical phase.
Publisher
Springer Science and Business Media LLC
Reference57 articles.
1. Aizenman, M., Barsky, D.J.: Sharpness of the phase transition in percolation models. Commun. Math. Phys. 108(3), 489–526 (1987)
2. Aizenman, M., Delyon, F., Souillard, B.: Lower bounds on the cluster size distribution. J. Stat. Phys. 23(3), 267–280 (1980)
3. Aizenman, M., Kesten, H., Newman, C.M.: Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation. Commun. Math. Phys. 111(4), 505–531 (1987)
4. Aizenman, M., Newman, C.M.: Tree graph inequalities and critical behavior in percolation models. J. Stat. Phys. 36(1–2), 107–143 (1984)
5. Aldous, D., Lyons, R.: Processes on unimodular random networks. Electron. J. Probab. 12(54), 1454–1508 (2007)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献