Random interlacements and amenability

DOI10.1214/12-AAP860MaRDI QIDQ1950258zbMATH OpenOpenAlexFDO

Authors A. Teixeira, Johan Tykesson

Publication date 10 May 2013

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1103.2109, https://projecteuclid.org/euclid.aoap/1362684850

zbMATH Keywords

amenabilitygraphsrandom interlacementsrandom walks

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41)

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 ${mathbbZ}^d$ (with $dgeq3$). In Sznitman [Ann. of Math. (2) (2010) 171 2039-2087], it was shown that on ${mathbbZ}^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.

Recommendations

• On the transience of random interlacements
• The random cluster model on a general graph and a phase transition characterization of nonamenability
• On the size of a finite vacant cluster of random interlacements with small intensity
• Interlacement percolation on transient weighted graphs
• Connectivity properties of random interlacement and intersection of random walks

Cites work

• Asymptotic behavior of a stochastic combustion growth process
• Cover levels and random interlacements
• Decoupling inequalities and interlacement percolation on G Z
• Density and uniqueness in percolation
• Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
• Giant vacant component left by a random walk in a random \(d\)-regular graph
• Group-invariant percolation on graphs
• How universal are asymptotics of disconnection times in discrete cylinders?
• scientific article; zbMATH DE number 5242364 (Why is no real title available?)
• scientific article; zbMATH DE number 4188961 (Why is no real title available?)
• Interlacement percolation on transient weighted graphs
• Monotonicity of uniqueness for percolation on Cayley graphs: All infinite clusters are born simultaneously
• On non-uniqueness of percolation on nonamenable Cayley graphs
• On the domination of a random walk on a discrete cylinder by random interlacements
• On the fragmentation of a torus by random walk
• Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
• Percolation for the vacant set of random interlacements
• Percolation in the hyperbolic plane
• Random walk on a discrete torus and random interlacements
• Random walks on discrete cylinders and random interlacements
• Random walks on discrete cylinders with large bases and random interlacements
• Random Walks on Infinite Graphs and Groups
• Stability of infinite clusters in supercritical percolation
• The shape theorem for the frog model
• Uniform spanning forests
• Uniqueness and non-uniqueness in percolation theory
• Upper bound on the disconnection time of discrete cylinders and random interlacements
• Vacant set of random interlacements and percolation

Cited in

(12)

• Interlacement percolation on transient weighted graphs
• Interlacements and the wired uniform spanning forest
• Finite-energy infinite clusters without anchored expansion
• Finitary random interlacements and the Gaboriau-Lyons problem
• Continuity and uniqueness of percolation critical parameters in finitary random interlacements
• The social network model on infinite graphs
• Extensive amenability and an application to interval exchanges
• Random interlacement is a factor of i.i.d.
• Uniqueness of the infinite connected component for the vacant set of random interlacements on amenable transient graphs
• On the transience of random interlacements
• First passage percolation, local uniqueness for interlacements and capacity of random walk
• Geometry of Gaussian free field sign clusters and random interlacements

This page was built for publication: Random interlacements and amenability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950258)