4 citations · 4 across the 1 of their papers we have counts for
2 papers
math.PR2009★ 4 cited
Is the critical percolation probability local?
Itai Benjamini, Asaf Nachmias, Yuval Peres
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…
math.PR2007★ 113 cited
Critical random graphs: Diameter and mixing time
Asaf Nachmias, Yuval Peres
Let denote the largest connected component of the critical Erdős--Rényi random graph . We show that, typically, the diameter of …