Expansion of Percolation Critical Points for Hamming Graphs

DOI10.1017/S0963548319000208zbMath1434.60287arXiv1701.02099OpenAlexW2577574236MaRDI QIDQ5222571

Tim Hulshof, Lorenzo Federico, Remco van der Hofstad, W. Th. 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) Percolation (82B43) Processes in random environments (60K37)

Related Items

Expansion for the critical point of site percolation: the first three terms, Parking on Cayley trees and frozen Erdős-Rényi, 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

Cites Work

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