The Critical Phase for Random Graphs with a Given Degree Sequence

DOI10.1017/S096354830700867XMaRDI QIDQ5448991zbMATH OpenFDO

Authors Mihyun Kang, Taral Guldahl Seierstad

Publication date 10 March 2008

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S096354830700867X

zbMATH Keywords

branching processgiant component

Mathematics Subject Classification ID

Vertex degrees (05C07) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• A critical point for random graphs with a given degree sequence
• The Structure of a Random Graph at the Point of the Phase Transition
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Evolution of Random Graphs
• A general critical condition for the emergence of a giant component in random graphs with given degrees

Cites work

• Component behavior near the critical point of the random graph process
• Connected components in random graphs with given expected degree sequences
• The asymptotic number of labeled graphs with given degree sequences
• The Evolution of Random Graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence

Cited in

(23)

• The evolution of the min-min random graph process
• Universality for critical heavy-tailed network models: metric structure of maximal components
• An old approach to the giant component problem
• Phase transitions on Markovian bipartite graphs-an application of the zero-range process
• Critical behavior in inhomogeneous random graphs
• A general critical condition for the emergence of a giant component in random graphs with given degrees
• The Bohman-Frieze process near criticality
• The scaling window for a random graph with a given degree sequence
• SIR epidemics on random graphs with a fixed degree sequence
• Evolution of random graph processes with degree constraints
• Giant component in random multipartite graphs with given degree sequences
• A new approach to the giant component problem
• A critical point for random graphs with a given degree sequence
• The component sizes of a critical random graph with given degree sequence
• Percolation on random graphs with a fixed degree sequence
• Component structure of the configuration model: barely supercritical case
• Law of large numbers for the SIR epidemic on a random graph with given degrees
• scientific article; zbMATH DE number 6297796 (Why is no real title available?)
• Susceptibility of random graphs with given vertex degrees
• The Small Giant Component in Scale-Free Random Graphs
• The Threshold of Symmetry in Random Graphs with Specified Degree Sequences
• How to determine if a random graph with a fixed degree sequence has a giant component
• Exact enumeration of graphs and bipartite graphs with degree constraints (extended abstract)

This page was built for publication: The Critical Phase for Random Graphs with a Given Degree Sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448991)