Critical percolation on random regular graphs

DOI10.1002/rsa.20277zbMath1209.05228arXiv0707.2839MaRDI QIDQ3055881

Yuval Peres, Asaf Nachmias

Publication date: 10 November 2010

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

percolation; random regular graph

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

Related Items

Aggregation models with limited choice and the multiplicative coalescent, Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs, Component Games on Regular Graphs, Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time, Sharp threshold for percolation on expanders, The convergence of the exploration process for critical percolation on the \(k\)-out graph, Critical random graphs: Diameter and mixing time, The critical random graph, with martingales, On a random graph evolving by degrees, Giant vacant component left by a random walk in a random \(d\)-regular graph, The continuum limit of critical random graphs, Mean-field conditions for percolation on finite graphs, Critical window for the vacant set left by random walk on random regular graphs, Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1., A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics, A new approach to the giant component problem

Cites Work

• Unnamed Item
• Critical random graphs: Diameter and mixing time
• Edge percolation on a random regular graph of low degree
• The critical random graph, with martingales
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Percolation on finite graphs and isoperimetric inequalities.
• Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
• The transitive closure of a random digraph
• On Deviations of the Sample Mean
• 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
• Percolation on Sparse Random Graphs with Given Degree Sequence
• The giant component threshold for random regular graphs with edge faults H. Prodinger