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

DOI10.1137/050630106MaRDI QIDQ3440263zbMATH OpenOpenAlexFDO

Authors Linyuan Lu, Fan 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)

Recommendations

• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• A general critical condition for the emergence of a giant component in random graphs with given degrees
• Connected components in random graphs with given expected degree sequences
• A new approach to the giant component problem
• An old approach to the giant component problem

Cited in

(34)

• Critical behavior in inhomogeneous random graphs
• Large deviations in generalized random graphs with node weights
• The degree sequences of an asymmetrical growing network
• Upper bounds for the largest component in critical inhomogeneous random graphs
• Novel scaling limits for critical inhomogeneous random graphs
• Evolution of a modified binomial random graph by agglomeration
• Cliques in rank-1 random graphs: the role of inhomogeneity
• An integer programming framework for critical elements detection in graphs
• Stochastic recursions on directed random graphs
• A random graph model for clustering graphs
• Component structure of the configuration model: barely supercritical case
• Building a random network with a given expected giant component
• An elementary approach to component sizes in critical random graphs
• The phase transition in multitype binomial random graphs
• Limit laws in the generalized random graphs with random vertex weights
• Universality for distances in power-law random graphs
• Maximizing the size of the giant
• Asymptotic coarse Ricci curvature of inhomogeneous random graph
• PageRank on inhomogeneous random digraphs
• scientific article; zbMATH DE number 7650113 (Why is no real title available?)
• Generating large scale‐free networks with the Chung–Lu random graph model
• Enumeration of graphs with a heavy-tailed degree sequence
• Wildfire fuel management: network-based models and optimization of prescribed burning
• Large deviations for power-law thinned Lévy processes
• Survey of scalings for the largest connected component in inhomogeneous random graphs
• Cluster tails for critical power-law inhomogeneous random graphs
• Phase transition in random intersection graphs with communities
• The Largest Component in Subcritical Inhomogeneous Random Graphs
• PageRank's behavior under degree correlations
• Non-hyperbolicity of random graphs with given expected degrees
• A note on the warmth of random graphs with given expected degrees
• Phase transitions in a power-law uniform hypergraph
• Rate of convergence to the Poisson law of the numbers of cycles in the generalized random graphs
• Mixing time of the switch Markov chain and stable degree sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3440263)