Limitations of Chung Lu random graph generation

DOI10.1007/978-3-030-93409-5_38zbMath1506.05186OpenAlexW4205890664MaRDI QIDQ2086622

George Slota, Christopher Brissette

Publication date: 25 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93409-5_38

zbMATH Keywords

random graphsgraph generation

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Spectrum Consistent Coarsening Approximates Edge Weights

Cites Work

• Generating simple random graphs with prescribed degree distribution
• Vandermonde matrices on integer nodes
• Critical behavior in inhomogeneous random graphs
• A Scalable Generative Graph Model with Community Structure
• Efficient Generation of Networks with Given Expected Degrees
• Configuring Random Graph Models with Fixed Degree Sequences
• Moments of Uniform Random Multigraphs with Fixed Degree Sequences
• The average distances in random graphs with given expected degrees

This page was built for publication: Limitations of Chung Lu random graph generation