The Volume of the Giant Component of a Random Graph with Given Expected Degrees

DOI10.1137/050630106zbMath1119.05098OpenAlexW2139975838MaRDI QIDQ3440263

Linyuan Lu, Fan R. K. Chung

Publication date: 22 May 2007

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050630106

zbMATH Keywords

volumerandom graphgiant componentgiven expected degree sequence

Mathematics Subject Classification ID

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

Related Items (31)

Large deviations for power-law thinned Lévy processes ⋮ An elementary approach to component sizes in critical random graphs ⋮ Large deviations in generalized random graphs with node weights ⋮ Mixing time of the switch Markov chain and stable degree sequences ⋮ Wildfire fuel management: network-based models and optimization of prescribed burning ⋮ A random graph model for clustering graphs ⋮ Phase transition in random intersection graphs with communities ⋮ An integer programming framework for critical elements detection in graphs ⋮ Generating large scale‐free networks with the Chung–Lu random graph model ⋮ Enumeration of graphs with a heavy-tailed degree sequence ⋮ Phase transitions in a power-law uniform hypergraph ⋮ Unnamed Item ⋮ Stochastic recursions on directed random graphs ⋮ Unnamed Item ⋮ Limit laws in the generalized random graphs with random vertex weights ⋮ PageRank on inhomogeneous random digraphs ⋮ PageRank's behavior under degree correlations ⋮ Evolution of a modified binomial random graph by agglomeration ⋮ Cluster tails for critical power-law inhomogeneous random graphs ⋮ Novel scaling limits for critical inhomogeneous random graphs ⋮ Non-Hyperbolicity of Random Graphs with Given Expected Degrees ⋮ Cliques in rank-1 random graphs: the role of inhomogeneity ⋮ Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs ⋮ The Largest Component in Subcritical Inhomogeneous Random Graphs ⋮ The degree sequences of an asymmetrical growing network ⋮ Universality for distances in power-law random graphs ⋮ Component structure of the configuration model: Barely supercritical case ⋮ Critical behavior in inhomogeneous random graphs ⋮ A note on the warmth of random graphs with given expected degrees ⋮ The Phase Transition in Multitype Binomial Random Graphs ⋮ Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs

This page was built for publication: The Volume of the Giant Component of a Random Graph with Given Expected Degrees