A general critical condition for the emergence of a giant component in random graphs with given degrees

DOI10.1016/j.endm.2009.07.108zbMath1273.05201arXivmath/0701474OpenAlexW2142290020MaRDI QIDQ2851532

Nikolaos Fountoulakis, Bruce A. Reed

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random graphscoregiven degree sequencegiant component problemlinear total degree

Mathematics Subject Classification ID

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

Related Items (2)

The scaling window for a random graph with a given degree sequence ⋮ How to determine if a random graph with a fixed degree sequence has a giant component

Cites Work

• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Statistical mechanics of complex networks
• A simple solution to the k‐core problem
• A new approach to the giant component problem
• A critical point for random graphs with a given degree sequence
• The Critical Phase for Random Graphs with a Given Degree Sequence
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A general critical condition for the emergence of a giant component in random graphs with given degrees