On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase

DOI10.1214/07-AAP493zbMath1149.05043arXiv0808.2907OpenAlexW2028779053MaRDI QIDQ939084

Boris G. Pittel

Publication date: 20 August 2008

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0808.2907

zbMATH Keywords

random graphpower lawdegree sequencelargest component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Related Items

SIR epidemics on random graphs with a fixed degree sequence ⋮ Largest component of subcritical random graphs with given degree sequence ⋮ The component sizes of a critical random graph with given degree sequence ⋮ The largest component in a subcritical random graph with a power law degree distribution ⋮ Bounded-Size Rules: The Barely Subcritical Regime

Cites Work

• The largest component in a subcritical random graph with a power law degree distribution
• Edge percolation on a random regular graph of low degree
• The asymptotic number of labeled graphs with given degree sequences
• Bootstrap percolation on the random regular graph
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• A critical point for random graphs with a given degree sequence
• Unnamed Item
• Unnamed Item
• Unnamed Item