Random interlacements and amenability

DOI10.1214/12-AAP860zbMATH Open1375.60139arXiv1103.2109OpenAlexW2027558753MaRDI QIDQ1950258FDOQ1950258

Authors: A. Teixeira, Johan Tykesson 

Publication date: 10 May 2013

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

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.

Full work available at URL: https://arxiv.org/abs/1103.2109

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

zbMATH Keywords

graphsrandom walksrandom interlacementsamenability

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)

Cites Work

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

Cited In (11)

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

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)