Hypercube percolation
DOI10.4171/JEMS/679zbMath1381.60119MaRDI QIDQ520736
Remco van der Hofstad, Asaf Nachmias
Publication date: 5 April 2017
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
hypercubepercolationsurvival probabilitycritical behaviormixing timerandom graphMarkov inequalitycluster sizescaling windowbirth of the giant componentBK-Reimer inequalityintrinsic metric regularitymean-field resultsnon-backtracking random walkshort and long connection probabilitiesshort and long supercritical trianglessubcritical phasesupercritical phase
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixing time of near-critical random graphs
- Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
- A note about critical percolation on finite graphs
- Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
- Random graph asymptotics on high-dimensional tori
- Mean-field critical behaviour for percolation in high dimensions
- Critical random graphs: Diameter and mixing time
- The Alexander-Orbach conjecture holds in high dimensions
- Tree graph inequalities and critical behavior in percolation models
- Largest random component of a k-cube
- Percolation critical exponents under the triangle condition
- Evolution of the \(n\)-cube
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Counting connected graphs inside-out
- On a combinatorial conjecture concerning disjoint occurrences of events
- Sharpness of the phase transition in percolation models
- Percolation on finite graphs and isoperimetric inequalities.
- Non-backtracking random walk
- Progress in high-dimensional percolation and random graphs
- 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
- Mean-field conditions for percolation on finite graphs
- The scaling window of the 2-SAT transition
- The mixing time of the giant component of a random graph
- 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
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Expander graphs and their applications
- The evolution of the mixing rate of a simple random walk on the giant component of a random graph
- Majority Bootstrap Percolation on the Hypercube
- Inequalities with applications to percolation and reliability
- The Evolution of Random Graphs
- Component behavior near the critical point of the random graph process
- The Evolution of Random Subgraphs of the Cube
- Percolation
- The Structure of a Random Graph at the Point of the Phase Transition
- A critical point for random graphs with a given degree sequence
- Bootstrap Percolation in High Dimensions
- Proof of the Van den Berg–Kesten Conjecture
- The birth of the giant component
- Random subgraphs of finite graphs: I. The scaling window under the triangle condition
- Arm exponents in high dimensional percolation
- Asymptotic expansions inn−1 for percolation critical values on then-Cube and ℤn
- Quasi-random graphs