Random subgraphs of finite graphs. II: The lace expansion and the triangle condition

DOI10.1214/009117905000000260zbMath1079.05087arXivmath/0401070MaRDI QIDQ2571699

Remco van der Hofstad, Gordon Slade, Christian Borgs, Jennifer T. Chayes, J. H. Spencer

Publication date: 14 November 2005

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

random walks; bond percolation; random graph; lace expansion; percolation phase transition; percolation triangle condition

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

60K35: Interacting random processes; statistical mechanics type models; percolation theory

82B43: Percolation

Related Items

Site Percolation on the d-Dimensional Hamming Torus, Cycle structure of percolation on high-dimensional tori, Conformally invariant scaling limits in planar critical percolation, Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time, A note about critical percolation on finite graphs, Random graph asymptotics on high-dimensional tori, Edge percolation on a random regular graph of low degree, Critical behavior and the limit distribution for long-range oriented percolation. I, Mean-field behavior for long- and finite range Ising model, percolation and self-avoiding walk, On a random graph evolving by degrees, Random walk on the high-dimensional IIC, Bootstrap percolation on the Hamming torus, Percolation on dense graph sequences, On the expected total number of infections for virus spread on a finite network, Random subgraphs of the 2D Hamming graph: The supercritical phase, Unlacing hypercube percolation: a survey, High-dimensional incipient infinite clusters revisited, Critical points for spread-out self-avoiding walk, percolation and the contact process above the upper critical dimensions, Mean-field conditions for percolation on finite graphs, Clique percolation, The second largest component in the supercritical 2D Hamming graph, Critical percolation on random regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
• Mean-field critical behaviour for percolation in high dimensions
• Self-avoiding walk in 5 or more dimensions
• Tree graph inequalities and critical behavior in percolation models
• The diffusion of self-avoiding random walk in high dimensions
• Percolation critical exponents under the triangle condition
• The lace expansion on a tree with application to networks of self-avoiding walks
• A generalised inductive approach to the lace expansion
• Sharpness of the phase transition in percolation models
• Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models.
• Gap exponents for percolation processes with triangle condition
• Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals
• On the number of incipient spanning clusters
• The scaling limit of the incipient infinite cluster in high-dimensional percolation. II. Integrated super-Brownian excursion
• Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms
• Percolation
• The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition
• Asymptotic expansions inn−1 for percolation critical values on then-Cube and ℤn