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).
机构:
Sobolev Inst Math, Ak Koptyug Av 4, Novosibirsk 630090, Russia
Novosibirsk State Univ, Pirogova Str 2, Novosibirsk 630090, RussiaSobolev Inst Math, Ak Koptyug Av 4, Novosibirsk 630090, Russia
Konstantinova, Elena, V
Lytkina, Dania
论文数: 0引用数: 0
h-index: 0
机构:
Novosibirsk State Univ, Pirogova Str 2, Novosibirsk 630090, Russia
Siberian State Univ Telecommun & Informat Sci, Kirova Str 86, Novosibirsk 630108, RussiaSobolev Inst Math, Ak Koptyug Av 4, Novosibirsk 630090, Russia
机构:
Shahid Rajaee Teacher Training Univ, Dept Math, Fac Sci, Tehran 16785136, IranShahid Rajaee Teacher Training Univ, Dept Math, Fac Sci, Tehran 16785136, Iran
Ghorbani, Modjtaba
Nowroozi-Larki, Farzaneh
论文数: 0引用数: 0
h-index: 0
机构:
Shahid Rajaee Teacher Training Univ, Dept Math, Fac Sci, Tehran 16785136, IranShahid Rajaee Teacher Training Univ, Dept Math, Fac Sci, Tehran 16785136, Iran