A note on the local weak limit of a sequence of expander graphs
From MaRDI portal
Abstract: We show that the local weak limit of a sequence of finite expander graphs with uniformly bounded degree is an ergodic (or extremal) unimodular random graph. In particular, the critical probability of percolation of the limiting random graph is constant almost surely. As a corollary, we obtain an improvement to a theorem by Benjamini-Nachmias-Peres (2011) on locality of percolation probability for finite expander graphs with uniformly bounded degree where we can drop the assumption that the limit is a single rooted graph.
Recommendations
Cites work
- scientific article; zbMATH DE number 3245885 (Why is no real title available?)
- Is the critical percolation probability local?
- Locality of percolation for abelian Cayley graphs
- Locality of the critical probability for transitive graphs of exponential growth
- On percolation critical probabilities and unimodular random graphs
- Percolation on finite graphs and isoperimetric inequalities.
- Processes on unimodular random networks
- Recurrence of distributional limits of finite planar graphs
- Sharp threshold for percolation on expanders
Cited in
(6)- Locality of random digraphs on expanders
- Tangent graphs
- Supercritical percolation on finite transitive graphs I: uniqueness of the giant component
- Sharpness and locality for percolation on finite transitive graphs
- Non-triviality of the phase transition for percolation on finite transitive graphs
- Percolation on preferential attachment models
This page was built for publication: A note on the local weak limit of a sequence of expander graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064867)