Random subgraphs of finite graphs: I. The scaling window under the triangle condition
From MaRDI portal
Publication:5318244
DOI10.1002/RSA.20051zbMath1076.05071arXivmath/0401069OpenAlexW2949544577MaRDI QIDQ5318244
Remco van der Hofstad, Gordon Slade, Jennifer T. Chayes, Christian Borgs, J. H. Spencer
Publication date: 22 September 2005
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0401069
Related Items (41)
Self-avoiding walk on the complete graph ⋮ Random subgraphs of the 2D Hamming graph: The supercritical phase ⋮ The scaling window of the 5D Ising model with free boundary conditions ⋮ On the derivation of mean-field percolation critical exponents from the triangle condition ⋮ Mean-field conditions for percolation on finite graphs ⋮ Critical percolation on scale-free random graphs: new universality class for the configuration model ⋮ Random graph asymptotics on high-dimensional tori ⋮ The giant component after percolation of product graphs ⋮ Self‐avoiding walk on the hypercube ⋮ Slightly supercritical percolation on non‐amenable graphs I: The distribution of finite clusters ⋮ Cycle structure of percolation on high-dimensional tori ⋮ The near-critical two-point function and the torus plateau for weakly self-avoiding walk in high dimensions ⋮ High-dimensional near-critical percolation and the torus plateau ⋮ Weakly self-avoiding walk on a high-dimensional torus ⋮ Giant vacant component left by a random walk in a random \(d\)-regular graph ⋮ Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome? ⋮ Conformally invariant scaling limits in planar critical percolation ⋮ Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time ⋮ Unlacing hypercube percolation: a survey ⋮ Probability Theory in Statistical Physics, Percolation, and Other Random Topics: The Work of C. Newman ⋮ A note about critical percolation on finite graphs ⋮ The Evolution of the Cover Time ⋮ Critical random graphs: Diameter and mixing time ⋮ Edge percolation on a random regular graph of low degree ⋮ A phase transition for the metric distortion of percolation on the hypercube ⋮ On the critical probability in percolation ⋮ Site Percolation on the d-Dimensional Hamming Torus ⋮ Hypercube percolation ⋮ Percolation on dense graph sequences ⋮ The critical random graph, with martingales ⋮ Clique percolation ⋮ The second largest component in the supercritical 2D Hamming graph ⋮ Critical percolation on random regular graphs ⋮ Expansion of Percolation Critical Points for Hamming Graphs ⋮ Critical behavior in inhomogeneous random graphs ⋮ On a random graph evolving by degrees ⋮ Correction to: ``Random graph asymptotics on high-dimensional tori. II: Volume, diameter and mixing time ⋮ Random subgraphs of finite graphs. II: The lace expansion and the triangle condition ⋮ On the expected total number of infections for virus spread on a finite network ⋮ Universal finite-size scaling for percolation theory in high dimensions ⋮ Critical percolation on random regular graphs
Cites Work
This page was built for publication: Random subgraphs of finite graphs: I. The scaling window under the triangle condition
