Is the critical percolation probability local?
成果类型：
Article
署名作者：
Benjamini, Itai; Nachmias, Asaf; Peres, Yuval
署名单位：
Weizmann Institute of Science; Microsoft
刊物名称：
PROBABILITY THEORY AND RELATED FIELDS
ISSN/ISSBN：
0178-8051
DOI：
10.1007/s00440-009-0251-5
发表日期：
2011
页码：
261-269
关键词：
摘要：
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.