Is the critical percolation probability local?
classification
🧮 math.PR
math.GR
keywords
criticalpercolationprobabilityconjectured-regularanaloguecaseclose
read the original 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. This is a special case of a conjecture due to O. Schramm on the locality of p_c. We also prove a finite analogue of the conjecture for expander graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.