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 Edit this on Wikidata


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




Cites Work


Cited In (4)





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)