Random interlacements and amenability

Abstract

We consider the model of random interlacements on transient graphs, which was first introduced by Sznitman [Ann. of Math. (2) (2010) 171 2039-2087] for the special case of ${\mathbb{Z}}^d$ (with $d\ge 3$). In Sznitman [Ann. of Math. (2) (2010) 171 2039-2087], it was shown that on ${\mathbb{Z}}^d$: for any intensity $u>0$, the interlacement set is almost surely connected. The main result of this paper says that for transient, transitive graphs, the above property holds if and only if the graph is amenable. In particular, we show that in nonamenable transitive graphs, for small values of the intensity u the interlacement set has infinitely many infinite clusters. We also provide examples of nonamenable transitive graphs, for which the interlacement set becomes connected for large values of u. Finally, we establish the monotonicity of the transition between the "disconnected" and the "connected" phases, providing the uniqueness of the critical value $u_c$ where this transition occurs.

Published in at http://dx.doi.org/10.1214/12-AAP860 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (6)

• Decoupling inequalities and interlacement percolation on G x Z
• On the fragmentation of a torus by random walk
• Giant vacant component left by a random walk in a random d-regular graph
• How universal are asymptotics of disconnection times in discrete cylinders?
• Upper bound on the disconnection time of discrete cylinders and random interlacements
• Cover levels and random interlacements

Cited by in corpus (7)

• Geometry of Gaussian free field sign clusters and random interlacements
• Interlacements and the Wired Uniform Spanning Forest
• Poisson cylinders in hyperbolic space
• Random interlacement is a factor of i.i.d
• First passage percolation, local uniqueness for interlacements and capacity of random walk
• Uniqueness of the infinite connected component for the vacant set of random interlacements on amenable transient graphs
• On the transience of random interlacements