Existence of a Percolation Threshold on Finite Transitive Graphs

DOI10.1093/IMRN/RNAD222MaRDI QIDQ6182622zbMATH OpenOpenAlexFDO

Authors Philip Easo

Publication date 25 January 2024

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2208.09501

zbMATH Keywords

Bernoulli bond percolationvertex-transitive gfgraphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Combinatorial probability (60C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Abstract: Let $(G_n)$ be a sequence of finite connected vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)$ is a percolation threshold if for every $varepsilon>0$, the proportion $leftlVert{K}_{1}ightVert$ of vertices contained in the largest cluster under bond percolation $mathbb{P}_p^G$ satisfies both [ �egin{split} lim_{n o infty} mathbb{P}_{(1+varepsilon)p_n}^{G_n} left( leftlVert K_1 ight Vert geq alpha ight) &= 1 quad ext{for some $alpha>0$, and}\ lim_{n o infty} mathbb{P}_{(1-varepsilon)p_n}^{G_n} left( leftlVert K_1 ight Vert geq alpha ight) &= 0 quad ext{for all $alpha>0$}. end{split}] We prove that $(G_n)$ has a percolation threshold if and only if $(G_n)$ does not contain a particular infinite collection of pathological subsequences of dense graphs. Our argument uses an adaptation of Vanneuville's new proof of the sharpness of the phase transition for infinite graphs via couplings [Van22] together with our recent work with Hutchcroft on the uniqueness of the giant cluster [EH21].

Recommendations

• Supercritical percolation on finite transitive graphs I: uniqueness of the giant component
• Percolation on dense graph sequences
• Percolation on finite graphs and isoperimetric inequalities.
• The sharp threshold for percolation on expander graphs
• Mean-field conditions for percolation on finite graphs

Cited in

(5)

• Supercritical percolation on finite transitive graphs I: uniqueness of the giant component
• Sharpness and locality for percolation on finite transitive graphs
• Non-triviality of the phase transition for percolation on finite transitive graphs
• Exponential decay of the volume for Bernoulli percolation: a proof via stochastic comparison
• Crossing bridges between percolation models and Bienaymé-Galton-Watson trees

This page was built for publication: Existence of a Percolation Threshold on Finite Transitive Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182622)