Sharpness for inhomogeneous percolation on quasi-transitive graphs
From MaRDI portal
Publication:2322643
DOI10.1016/J.SPL.2019.03.013zbMATH Open1459.60194arXiv1802.03289OpenAlexW2962903359MaRDI QIDQ2322643FDOQ2322643
Authors: Thomas Beekenkamp, Tim Hulshof
Publication date: 5 September 2019
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Abstract: In this note we study the phase transition for percolation on quasi-transitive graphs with quasi-transitively inhomogeneous edge-retention probabilities. A quasi-transitive graph is an infinite graph with finitely many different "types" of edges and vertices. We prove that the transition is sharp almost everywhere, i.e., that in the subcritical regime the expected cluster size is finite, and that in the subcritical regime the probability of the one-arm event decays exponentially. Our proof extends the proof of sharpness of the phase transition for homogeneous percolation on vertex-transitive graphs by Duminil-Copin and Tassion [Comm. Math. Phys., 2016], and the result generalizes previous results of Antunovi'c and Veseli'c [J. Stat. Phys., 2008] and Menshikov [Dokl. Akad. Nauk 1986].
Full work available at URL: https://arxiv.org/abs/1802.03289
Recommendations
- Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs
- Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters
- Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
- Sharp phase transition in percolation via randomized algorithms [after Duminil-Copin, Raoufi, and Tassion]
- Sharpness of the phase transition for the corrupted compass model on transitive graphs
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)
Cites Work
- Sharpness of the phase transition in percolation models
- Title not available (Why is that?)
- Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs
- A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
- On the critical percolation probabilities
- Inequalities with applications to percolation and reliability
- A new proof of the sharpness of the phase transition for Bernoulli percolation on \(\mathbb{Z}^d\)
- Percolation beyond \(\mathbb Z^{d}\): the contributions of Oded Schramm
Cited In (4)
- Percolation and isoperimetry on roughly transitive graphs
- Sharpness of the phase transition for the corrupted compass model on transitive graphs
- Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs
- Sharp phase transition in percolation via randomized algorithms [after Duminil-Copin, Raoufi, and Tassion]
This page was built for publication: Sharpness for inhomogeneous percolation on quasi-transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2322643)