Critical percolation on random regular graphs
From MaRDI portal
Abstract: We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In particular, we show that there is a scaling window of width n^{-1/3} around p_c in which the sizes of the largest components are roughly n^{2/3} and we describe their limiting joint distribution. We also show that for the subcritical regime, i.e. p = (1-eps(n))p_c where eps(n)=o(1) but eps(n)n^{1/3} tends to infinity, the sizes of the largest components are concentrated around an explicit function of n and eps(n) which is of order o(n^{2/3}). In the supercritical regime, i.e. p = (1+eps(n))p_c where eps(n)=o(1) but eps(n)n^{1/3} tends to infinity, the size of the largest component is concentrated around the value (2d/(d-2))eps(n)n and a duality principle holds: other component sizes are distributed as in the subcritical regime.
Recommendations
Cites work
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Component behavior near the critical point of the random graph process
- Component sizes of the random graph outside the scaling window
- Critical random graphs: Diameter and mixing time
- Edge percolation on a random regular graph of low degree
- On Deviations of the Sample Mean
- Percolation on finite graphs and isoperimetric inequalities.
- Percolation on sparse random graphs with given degree sequence
- Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
- Random subgraphs of finite graphs: I. The scaling window under the triangle condition
- Symmetric sampling procedures, general epidemic processes and their threshold limit theorems
- The asymptotic number of labeled graphs with given degree sequences
- The critical random graph, with martingales
- The Evolution of Random Graphs
- The giant component threshold for random regular graphs with edge faults H. Prodinger
- The transitive closure of a random digraph
Cited in
(55)- On percolation in random graphs with given vertex degrees
- On a random graph evolving by degrees
- Mesoscopic scales in hierarchical configuration models
- The largest component in critical random intersection graphs
- Critical random graphs and the differential equations technique
- On the critical probability in percolation
- Giant vacant component left by a random walk in a random \(d\)-regular graph
- Geometry of the minimal spanning tree of a random 3-regular graph
- Sandwiching dense random regular graphs between binomial random graphs
- The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
- Universality for critical heavy-tailed network models: metric structure of maximal components
- Heavy-tailed configuration models at criticality
- Preferential attachment without vertex growth: emergence of the giant component
- Size of the largest component in a critical graph
- The continuum limit of critical random graphs
- The critical point of \(k\)-clique percolation in the Erdős-Rényi graph
- Mean-field conditions for percolation on finite graphs
- Critical percolation on scale-free random graphs: new universality class for the configuration model
- 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
- scientific article; zbMATH DE number 3976062 (Why is no real title available?)
- Critical percolation on random regular graphs
- The unreasonable effectiveness of martingales
- Percolation on random graphs with a fixed degree sequence
- An elementary approach to component sizes in critical random graphs
- Asymptotics in percolation on high-girth expanders
- Aggregation models with limited choice and the multiplicative coalescent
- Survey of scalings for the largest connected component in inhomogeneous random graphs
- Hypercube percolation
- Random graphs with a fixed maximum degree
- Expansion of Percolation Critical Points for Hamming Graphs
- Component games on regular graphs
- Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems
- Color-avoiding percolation of random graphs: between the subcritical and the intermediate regime
- Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022
- The probability of unusually large components for critical percolation on random d-regular graphs
- Upper bounds for the largest component in critical inhomogeneous random graphs
- Stable graphs: distributions and line-breaking construction
- Metastability of the Potts ferromagnet on random regular graphs
- Largest component of subcritical random graphs with given degree sequence
- Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
- Percolation on dense random graphs with given degrees
- On moments of multiplicative coalescents
- Sharp threshold for percolation on expanders
- Scaling limit of the cluster size distribution for the random current measure on the complete graph
- Continuum limit of critical inhomogeneous random graphs
- Components, large and small, are as they should be. II: Supercritical percolation on regular graphs of constant degree
- Percolation on high-dimensional product graphs
- Is the critical percolation probability local?
- The convergence of the exploration process for critical percolation on the k-out graph
- Critical random graphs: Diameter and mixing time
- Edge percolation on a random regular graph of low degree
- The critical random graph, with martingales
This page was built for publication: Critical percolation on random regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055881)
