The second largest component in the supercritical 2D Hamming graph

DOI10.1002/rsa.20288zbMath1208.05139arXiv0801.1608OpenAlexW2951948287MaRDI QIDQ3055879

Remco van der Hofstad, J. H. Spencer, Malwina J. Luczak

Publication date: 10 November 2010

Published in: Random Structures and Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

percolationphase transitionrandom graphsscaling window

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items (3)

Unnamed Item ⋮ Hypercube percolation ⋮ Expansion of Percolation Critical Points for Hamming Graphs

Cites Work

• Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
• Random subgraphs of the 2D Hamming graph: The supercritical phase
• Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
• Mean-field conditions for percolation on finite graphs
• Component behavior near the critical point of the random graph process
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition

This page was built for publication: The second largest component in the supercritical 2D Hamming graph