Is the critical percolation probability local?

Simple item page
dc.creatorBenjamini, Itai
dc.creatorNachmias, Asaf
dc.creatorPeres, Yuval
dc.date2009-01-29
dc.date.accessioned2026-07-07T12:35:33Z
dc.date.available2026-07-07T12:35:33Z
dc.descriptionWe 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.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/0901.4616
dc.identifierhttp://arxiv.org/abs/0901.4616
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/217802
dc.subjectProbability
dc.subjectGroup Theory
dc.titleIs the critical percolation probability local?
dc.typetext

Files

Collections

arXiv