Giant Component in Random Multipartite Graphs with Given Degree Sequences

DOI10.1214/13-SSY135zbMath1358.05258arXiv1306.0597MaRDI QIDQ3466715

Sidhant Misra, David Gamarnik

Publication date: 25 January 2016

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

zbMATH Keywords

random graphsgiant componentdegree sequences

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (2)

Pandemic spread in communities via random graphs ⋮ On local weak limit and subgraph counts for sparse random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The asymptotic number of labeled graphs with given degree sequences
• Differential equations for random processes and random graphs
• An old approach to the giant component problem
• Distances in random graphs with finite mean and infinite variance degrees
• The Phase Transition in the Configuration Model
• A new approach to the giant component problem
• 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
• Directed random graphs with given degree distributions
• The phase transition in inhomogeneous random graphs
• Distances in random graphs with finite variance degrees
• The Critical Phase for Random Graphs with a Given Degree Sequence
• A Limit Theorem for Multidimensional Galton-Watson Processes

This page was built for publication: Giant Component in Random Multipartite Graphs with Given Degree Sequences