Expansion of Percolation Critical Points for Hamming Graphs

DOI10.1017/S0963548319000208MaRDI QIDQ5222571zbMATH OpenOpenAlexFDO

Authors Lorenzo Federico, Remco van der Hofstad, Tim Hulshof, F. den Hollander

Publication date 6 April 2020

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Processes in random environments (60K37) Percolation (82B43)

Abstract: The Hamming graph $H(d,n)$ is the Cartesian product of $d$ complete graphs on $n$ vertices. Let $m=d(n-1)$ be the degree and $V=n^d$ be the number of vertices of $H(d,n)$. Let $p_c^{(d)}$ be the critical point for bond percolation on $H(d,n)$. We show that, for $dinmathbbN$ fixed and $noinfty$, �egin{equation*} p_c^{(d)}= dfrac{1}{m} + dfrac{2d^2-1}{2(d-1)^2}dfrac{1}{m^2} + O(m^{-3}) + O(m^{-1}V^{-1/3}), end{equation*} which extends the asymptotics found in cite{BorChaHofSlaSpe05b} by one order. The term $O(m^{-1}{V}^{-1/3})$ is the width of the critical window. For $d=4,5,6$ we have $m^{-3}=O(m^{-1}{V}^{-1/3})$, and so the above formula represents the full asymptotic expansion of $p_c^{(d)}$. In cite{FedHofHolHul16a} st{we show that} this formula is a crucial ingredient in the study of critical bond percolation on $H(d,n)$ for $d=2,3,4$. The proof uses a lace expansion for the upper bound and a novel comparison with a branching random walk for the lower bound. The proof of the lower bound also yields a refined asymptotics for the susceptibility of a subcritical ErdH{o}s-R'enyi random graph.

Recommendations

• Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs
• Critical percolation on certain nonunimodular graphs
• Random subgraphs of the 2D Hamming graph: The supercritical phase
• The sharp threshold for percolation on expander graphs
• Existence of a phase transition of the interchange process on the Hamming graph
• Vertex percolation on expander graphs
• Partial Hamming graphs and expansion procedures
• Connectivity threshold for random subgraphs of the Hamming graph
• A note about critical percolation on finite graphs
• On the Expansion of the Giant Component in Percolated (n, d,λ) Graphs

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• A moment-generating formula for Erdős-Rényi component sizes
• Asymptotic expansions inn−1 for percolation critical values on then-Cube and ℤn
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Component sizes of the random graph outside the scaling window
• Connectivity threshold for random subgraphs of the Hamming graph
• Critical percolation on random regular graphs
• Critical random graphs: Diameter and mixing time
• Evolution of the n-cube
• Existence of a phase transition of the interchange process on the Hamming graph
• Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms
• Hypercube percolation
• Inequalities with applications to percolation and reliability
• Mean-field critical behaviour for percolation in high dimensions
• Non-backtracking random walk
• Novel scaling limits for critical inhomogeneous random graphs
• On the critical percolation probabilities
• On the critical probability in percolation
• On the largest component of the random graph at a nearcritical stage
• Percolation
• Progress in high-dimensional percolation and random graphs
• Random graph dynamics
• Random graphs and complex networks. Volume 1
• Random graphs.
• Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
• Random subgraphs of finite graphs. III: The phase transition for the n-cube
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition
• Random subgraphs of the 2D Hamming graph: The supercritical phase
• Scaling limits for critical inhomogeneous random graphs with finite third moments
• Self-avoiding walk in 5 or more dimensions
• Sharpness of the phase transition in percolation models
• Some limit theorems for the total progeny of a branching process
• The Evolution of Random Graphs
• The Structure of a Random Graph at the Point of the Phase Transition
• The birth of the giant component
• The component sizes of a critical random graph with given degree sequence
• The second largest component in the supercritical 2D Hamming graph
• Tree graph inequalities and critical behavior in percolation models
• Unlacing hypercube percolation: a survey

Cited in

(7)

• Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
• A moment-generating formula for Erdős-Rényi component sizes
• Connectivity threshold for random subgraphs of the Hamming graph
• A branching process with deletions and mergers that matches the threshold for hypercube percolation
• Expansion for the critical point of site percolation: the first three terms
• Parking on Cayley trees and frozen Erdős-Rényi
• Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms

This page was built for publication: Expansion of Percolation Critical Points for Hamming Graphs

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