On the Cluster Size Distribution for Percolation on Some General Graphs
Preprint
Abstract
We show that for any Cayley graph, the probability (at any $p$) that the cluster of the origin has size n decays at a well-defined exponential rate (possibly 0). For general graphs, we relate this rate being positive in the supercritical regime with the amenability/nonamenability of the underlying graph.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Cutsets in Infinite GraphsCombinatorics, Probability and Computing, 2006
- Anchored expansion, percolation and speedThe Annals of Probability, 2004
- The Scaling Limit of the Incipient Infinite Cluster in High-Dimensional Percolation. I. Critical ExponentsJournal of Statistical Physics, 2000
- Group-invariant Percolation on GraphsGeometric and Functional Analysis, 1999
- Monotonicity of uniqueness for percolation on Cayley graphs: all infinite clusters are born simultaneouslyProbability Theory and Related Fields, 1999
- The random cluster model on a general graph and a phase transition characterization of nonamenabilityStochastic Processes and their Applications, 1999
- Cut sets and normed cohomology with applications to percolationProceedings of the American Mathematical Society, 1999
- Automorphism Groups of Graphs with Quadratic GrowthJournal of Combinatorial Theory, Series B, 1997
- Sharpness of the phase transition in percolation modelsCommunications in Mathematical Physics, 1987
- Tree graph inequalities and critical behavior in percolation modelsJournal of Statistical Physics, 1984