Random subgraphs of the 2D Hamming graph: The supercritical phase
From MaRDI portal
Publication:2380761
DOI10.1007/s00440-009-0200-3zbMath1188.05141arXiv0801.1607OpenAlexW2135101946MaRDI QIDQ2380761
Remco van der Hofstad, Malwina J. Luczak
Publication date: 12 April 2010
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.1607
Related Items
Mean-field conditions for percolation on finite graphs, Critical random graphs: Diameter and mixing time, On the critical probability in percolation, Hypercube percolation, Bootstrap percolation on the Hamming torus, The second largest component in the supercritical 2D Hamming graph, A new approach to the giant component problem, Phase transition for the interchange and quantum Heisenberg models on the Hamming graph, Expansion of Percolation Critical Points for Hamming Graphs, Critical behavior in inhomogeneous random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Moment of degeneration of a branching process and height of a random tree
- Random graph asymptotics on high-dimensional tori
- A spectral lower bound for the treewidth of a graph and its consequences
- On-line routing of random calls in networks
- Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
- Mean-field conditions for percolation on finite graphs
- Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms
- Random subgraphs of finite graphs: I. The scaling window under the triangle condition
- The total progeny in a branching process and a related random walk
- Asymptotic expansions inn−1 for percolation critical values on then-Cube and ℤn
- The Multiplicative Process
- The birth of the infinite cluster: Finite-size scaling in percolation
