Component structure of the configuration model: Barely supercritical case
From MaRDI portal
Publication:5236922
DOI10.1002/rsa.20837zbMath1425.05145arXiv1611.05728OpenAlexW2963576542MaRDI QIDQ5236922
Svante Janson, Remco van der Hofstad, Malwina J. Luczak
Publication date: 16 October 2019
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.05728
Related Items
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, A probabilistic approach to the leader problem in random graphs, Largest component of subcritical random graphs with given degree sequence, Random graphs with given vertex degrees and switchings, Unnamed Item, Heavy-tailed configuration models at criticality, Preferential attachment without vertex growth: emergence of the giant component
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The component sizes of a critical random graph with given degree sequence
- Critical window for the configuration model: finite third moment degrees
- Near-critical SIR epidemic on a random graph with given degrees
- Scaling limits for critical inhomogeneous random graphs with finite third moments
- How to determine if a random graph with a fixed degree sequence has a giant component
- Novel scaling limits for critical inhomogeneous random graphs
- Generating simple random graphs with prescribed degree distribution
- Asymptotic normality of the \(k\)-core in random graphs
- On percolation in random graphs with given vertex degrees
- On the survival probability of a slightly advantageous mutant gene with a general distribution of progeny size. A branching process model
- Asymptotic rates of growth of the extinction probability of a mutant gene
- Rates of decay for the survival probability of a mutant gene
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Counting connected graphs inside-out
- Connected components in random graphs with given expected degree sequences
- An old approach to the giant component problem
- Universality for first passage percolation on sparse random graphs
- Random Graphs and Complex Networks
- The scaling window for a random graph with a given degree sequence
- Asymptotic equivalence and contiguity of some random graphs
- The Volume of the Giant Component of a Random Graph with Given Expected Degrees
- The Probability That a Random Multigraph is Simple
- A new approach to the giant component problem
- The Evolution of Random Graphs
- Component behavior near the critical point of the random graph process
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- The Structure of a Random Graph at the Point of the Phase Transition
- Orthogonal decompositions and functional limit theorems for random graph statistics
- The Average Distance in a Random Graph with Given Expected Degrees
- A critical point for random graphs with a given degree sequence
- Paths in graphs
- The probability that a random multigraph is simple. II
- The birth of the giant component
- The phase transition in inhomogeneous random graphs
- Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
- The Critical Phase for Random Graphs with a Given Degree Sequence
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process
- Probability: A Graduate Course
- Percolation on Sparse Random Graphs with Given Degree Sequence