In this paper, we study percolation on finite Cayley graphs. A conjecture of Benjamini says that the critical percolation p(c) of any vertex-transitive graph satisfying a certain diameter condition can be bounded away from one. We prove Benjamini's conjecture for some special classes of Cayley graphs. We also establish a reduction theorem, which allows us to build Cayley graphs for large groups without increasing p(c).
机构:
Yunnan Univ, Dept Math, Kunming 650031, Peoples R China
Univ Western Australia, Sch Math & Stat, Perth, WA 6009, AustraliaYunnan Univ, Dept Math, Kunming 650031, Peoples R China
Li CaiHeng
Lou BenGong
论文数: 0引用数: 0
h-index: 0
机构:
Yunnan Univ, Dept Math, Kunming 650031, Peoples R ChinaYunnan Univ, Dept Math, Kunming 650031, Peoples R China
Lou BenGong
Pan JiangMin
论文数: 0引用数: 0
h-index: 0
机构:
Yunnan Univ, Dept Math, Kunming 650031, Peoples R ChinaYunnan Univ, Dept Math, Kunming 650031, Peoples R China