On percolation critical probabilities and unimodular random graphs

Dorottya Beringer, Gábor Pete, Ádám Timár

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


We investigate generalizations of the classical percolation critical probabilities pc, pT and the critical probability pc defined by Duminil-Copin and Tassion [11] to bounded degree unimodular random graphs. We further examine Schramm’s conjecture in the case of unimodular random graphs: does pc(Gn) converge to pc(G) if Gn→ G in the local weak sense? Among our results are the following: • pc=pcholds for bounded degree unimodular graphs. However, there are unimodular graphs with sub-exponential volume growth and pT < pc; i.e., the classical sharpness of phase transition does not hold. • We give conditions which imply lim pc(Gn) = pc(limGn). • There are sequences of unimodular graphs such that Gn→ G but pc(G) > lim pc(Gn) or pc(G) < lim pc(Gn) < 1. As a corollary to our positive results, we show that for any transitive graph with subexponential volume growth there is a sequence Tnof large girth bi-Lipschitz invariant subgraphs such that pc(Tn) → 1. It remains open whether this holds whenever the transitive graph has cost 1.

Original languageEnglish
Article number106
JournalElectronic Journal of Probability
Publication statusPublished - 2017

Bibliographical note

Funding Information:
Our work was partially supported by the ERC Consolidator Grant 648017 (DB), the Hungarian National Research, Development and Innovation Office, NKFIH grant K109684 (GP and ÁT), an MTA Rényi Institute “Lendület” Research Group (GP), and an EU Marie Curie Fellowship (ÁT).

Publisher Copyright:
© 2017, University of Washington. All rights reserved.

Other keywords

  • Critical probability
  • Local weak convergence
  • Percolation
  • Unimodular random rooted graphs


Dive into the research topics of 'On percolation critical probabilities and unimodular random graphs'. Together they form a unique fingerprint.

Cite this