Mean-field conditions for percolation on finite graphs

DOI10.1007/s00039-009-0032-4zbMath1182.60025arXiv0709.1719OpenAlexW2130134592MaRDI QIDQ2655449

Asaf Nachmias

Publication date: 25 January 2010

Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)

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

zbMATH Keywords

non-backtracking random walk\(p\)-bond-percolationfinite transitive graphsmean-field conditions

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Related Items (8)

Random subgraphs of the 2D Hamming graph: The supercritical phase ⋮ Unnamed Item ⋮ Conformally invariant scaling limits in planar critical percolation ⋮ The Evolution of the Cover Time ⋮ Hypercube percolation ⋮ The second largest component in the supercritical 2D Hamming graph ⋮ Vertex percolation on expander graphs ⋮ Critical percolation on random regular graphs

Cites Work

• Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
• 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
• Edge percolation on a random regular graph of low degree
• On the critical behavior of the magnetization in high-dimensional Ising models
• Ramanujan graphs
• Largest random component of a k-cube
• Explicit constructions of graphs without short cycles and low density codes
• Random walks, capacity and percolation on trees
• Percolation on finite graphs and isoperimetric inequalities.
• Explicit construction of graphs with an arbitrary large girth and of large size
• Random subgraphs of the 2D Hamming graph: The supercritical phase
• Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
• Critical percolation on random regular graphs
• The transitive closure of a random digraph
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• Expander graphs and their applications
• The Evolution of Random Graphs
• Symmetric sampling procedures, general epidemic processes and their threshold limit theorems
• Component behavior near the critical point of the random graph process
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition
• Quasi-random graphs

This page was built for publication: Mean-field conditions for percolation on finite graphs