Connected components in random graphs with given expected degree sequences
type: Item
instance of: scholarly article
title: Connected components in random graphs with given expected degree sequences
zbMATH Open document ID: 1009.05124
DOI: 10.1007/PL00012580
author: Linyuan Lu
author: Fan Chung
published in: Annals of Combinatorics
publication date: 2003-03-27T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 1889229
zbMATH Keywords: random graphs
zbMATH Keywords: connected components
zbMATH Keywords: expected degree sequence
zbMATH Keywords: giant component
zbMATH Keywords: power law graphs
MaRDI profile type: Publication
full work available at URL: pl00012580
OpenAlex ID: W2112976607
Recommended article: Connectedness of certain random graphs
Recommended article: On the connectedness of a random graph
Recommended article: Estimation of the number of connected sets in a graph and the structure of components of random subsets
Recommended article: Q3791189
Recommended article: Connected components and evolution of random graphs: An algebraic approach
Recommended article: The component sizes of a critical random graph with given degree sequence
Recommended article: \(k\)-connectivity in random graphs
Recommended article: Bounds on probability of connectedness of a random graph
Recommended article: Random graphs with a given degree sequence
Recommended article: Giant Component in Random Multipartite Graphs with Given Degree Sequences
description: scientific article; zbMATH DE number 1889229