The Volume of the Giant Component of a Random Graph with Given Expected Degrees
From MaRDI portal
Publication:3440263
DOI10.1137/050630106zbMATH Open1119.05098OpenAlexW2139975838MaRDI QIDQ3440263FDOQ3440263
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
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 (33)
- PageRank on inhomogeneous random digraphs
- Survey of scalings for the largest connected component in inhomogeneous random graphs
- Phase transition in random intersection graphs with communities
- A note on the warmth of random graphs with given expected degrees
- Limit laws in the generalized random graphs with random vertex weights
- Universality for distances in power-law random graphs
- Novel scaling limits for critical inhomogeneous random graphs
- An integer programming framework for critical elements detection in graphs
- Component structure of the configuration model: barely supercritical case
- Generating large scale‐free networks with the Chung–Lu random graph model
- A random graph model for clustering graphs
- The Largest Component in Subcritical Inhomogeneous Random Graphs
- Large deviations for power-law thinned Lévy processes
- Large deviations in generalized random graphs with node weights
- Maximizing the size of the giant
- Asymptotic coarse Ricci curvature of inhomogeneous random graph
- Cluster tails for critical power-law inhomogeneous random graphs
- The degree sequences of an asymmetrical growing network
- The phase transition in multitype binomial random graphs
- Stochastic recursions on directed random graphs
- An elementary approach to component sizes in critical random graphs
- Evolution of a modified binomial random graph by agglomeration
- Enumeration of graphs with a heavy-tailed degree sequence
- Cliques in rank-1 random graphs: the role of inhomogeneity
- Critical behavior in inhomogeneous random graphs
- Mixing time of the switch Markov chain and stable degree sequences
- Wildfire fuel management: network-based models and optimization of prescribed burning
- Title not available (Why is that?)
- Non-hyperbolicity of random graphs with given expected degrees
- Rate of convergence to the Poisson law of the numbers of cycles in the generalized random graphs
- PageRank's behavior under degree correlations
- Title not available (Why is that?)
- Phase transitions in a power-law uniform hypergraph
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)
