The Critical Phase for Random Graphs with a Given Degree Sequence
From MaRDI portal
Publication:5448991
DOI10.1017/S096354830700867XzbMath1133.05092MaRDI QIDQ5448991
Taral Guldahl Seierstad, Mihyun Kang
Publication date: 10 March 2008
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (16)
SIR epidemics on random graphs with a fixed degree sequence ⋮ The scaling window for a random graph with a given degree sequence ⋮ Universality for critical heavy-tailed network models: metric structure of maximal components ⋮ The component sizes of a critical random graph with given degree sequence ⋮ How to determine if a random graph with a fixed degree sequence has a giant component ⋮ Giant Component in Random Multipartite Graphs with Given Degree Sequences ⋮ A new approach to the giant component problem ⋮ Component structure of the configuration model: Barely supercritical case ⋮ Critical behavior in inhomogeneous random graphs ⋮ The evolution of the min-min random graph process ⋮ A general critical condition for the emergence of a giant component in random graphs with given degrees ⋮ The Bohman-Frieze process near criticality ⋮ Law of large numbers for the SIR epidemic on a random graph with given degrees ⋮ Evolution of random graph processes with degree constraints ⋮ An old approach to the giant component problem ⋮ Percolation on Random Graphs with a Fixed Degree Sequence
Cites Work
- The asymptotic number of labeled graphs with given degree sequences
- Connected components in random graphs with given expected degree sequences
- 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
This page was built for publication: The Critical Phase for Random Graphs with a Given Degree Sequence