On the Cluster Size Distribution for Percolation on Some General Graphs
classification
🧮 math.PR
math-phmath.MP
keywords
clustergeneralgraphgraphsratesizeamenabilitycayley
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.