Is the critical percolation probability local?

Abstract

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. © 2009 Springer-Verlag.