Is the critical percolation probability local?

Itai Benjamini*, Asaf Nachmias, Yuval Peres

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

38 Scopus citations


We show that the critical probability for percolation on a d-regular non-amenable graph of large girth is close to the critical probability for percolation on an infinite d-regular tree. We also prove a finite analogue of this statement, Valid for expander graphs, Without any girth assumption.

Original languageEnglish
Pages (from-to)261-269
Number of pages9
JournalProbability Theory and Related Fields
Issue number1
StatePublished - Mar 2011
Externally publishedYes


Dive into the research topics of 'Is the critical percolation probability local?'. Together they form a unique fingerprint.

Cite this