Unlacing hypercube percolation: a survey
From MaRDI portal
Publication:2441320
DOI10.1007/s00184-013-0473-5zbMath1455.60132arXiv1201.3953OpenAlexW2170821586MaRDI QIDQ2441320
Remco van der Hofstad, Asaf Nachmias
Publication date: 24 March 2014
Published in: Metrika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.3953
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Graph theory (05C99)
Related Items (7)
Slightly supercritical percolation on non‐amenable graphs I: The distribution of finite clusters ⋮ Non-backtracking random walk ⋮ On the critical probability in percolation ⋮ Hypercube percolation ⋮ Expansion of Percolation Critical Points for Hamming Graphs ⋮ Percolation on an infinitely generated group ⋮ Expansion in supercritical random subgraphs of the hypercube and its consequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypercube percolation
- Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
- Percolation on a product of two trees
- Non-amenable Cayley graphs of high girth have \(p_c < p_u\) and mean-field exponents
- 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
- 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
- Non-backtracking random walk
- Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
- Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms
- Polygons and the Lace Expansion
- 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
- Multicyclic components in a random graph process
- Percolation
- The Structure of a Random Graph at the Point of the Phase Transition
- Proof of the Van den Berg–Kesten Conjecture
- Self-avoiding walk enumeration via the lace expansion
- 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
- Multiplicity of phase transitions and mean-field criticality on highly non-amenable graphs.
This page was built for publication: Unlacing hypercube percolation: a survey