Critical percolation on random regular graphs
From MaRDI portal
Publication:3055881
DOI10.1002/rsa.20277zbMath1209.05228arXiv0707.2839OpenAlexW2951553576MaRDI QIDQ3055881
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
Related Items
Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems, Mesoscopic scales in hierarchical configuration models, An elementary approach to component sizes in critical random graphs, The largest component in critical random intersection graphs, Mean-field conditions for percolation on finite graphs, Critical percolation on scale-free random graphs: new universality class for the configuration model, Universality for critical heavy-tailed network models: metric structure of maximal components, The convergence of the exploration process for critical percolation on the \(k\)-out graph, 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, 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, The continuum limit of critical random graphs, Giant vacant component left by a random walk in a random \(d\)-regular graph, Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time, Asymptotics in percolation on high‐girth expanders, Unnamed Item, Heavy-tailed configuration models at criticality, Sharp threshold for percolation on expanders, Critical random graphs: Diameter and mixing time, Preferential attachment without vertex growth: emergence of the giant component, Critical random graphs and the differential equations technique, Continuum limit of critical inhomogeneous random graphs, Hypercube percolation, Component Games on Regular Graphs, Aggregation models with limited choice and the multiplicative coalescent, The critical random graph, with martingales, Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs, Random Graphs with a Fixed Maximum Degree, Geometry of the minimal spanning tree of a random 3-regular graph, A new approach to the giant component problem, A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics, Size of the largest component in a critical graph, Expansion of Percolation Critical Points for Hamming Graphs, On a random graph evolving by degrees, Sandwiching dense random regular graphs between binomial random graphs, Critical window for the vacant set left by random walk on random regular graphs, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees, Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1., Percolation on Random Graphs with a Fixed Degree Sequence, Critical percolation on random regular graphs
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
