Efficient generation of networks with given expected degrees

DOI10.1007/978-3-642-21286-4_10MaRDI QIDQ3005576zbMATH OpenOpenAlexWikidataFDO

Authors Joel C. Miller, Aric Hagberg

Publication date 8 June 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://www.osti.gov/biblio/1053573

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Fast uniform generation of random graphs with given degree sequences
• A Sequential Algorithm for Generating Random Graphs
• Computing and Combinatorics
• Efficient and simple generation of random simple connected graphs with prescribed degree sequence
• A sequential algorithm for generating random graphs

Cited in

(14)

• Geometric inhomogeneous random graphs
• Limitations of Chung Lu random graph generation
• A simple and efficient algorithm for modeling modular complex networks
• Parameterized clique on inhomogeneous random graphs
• Efficient sampling methods for discrete distributions
• A mathematical analysis of the R-MAT random graph generator
• Comparing node degrees in probabilistic networks
• Sampling geometric inhomogeneous random graphs in linear time
• Coin-flipping, Ball-dropping, and Grass-hopping for generating random graphs from matrices of edge probabilities
• Generating Massive Scale-Free Networks under Resource Constraints
• Exact sublinear binomial sampling
• Generating large scale‐free networks with the Chung–Lu random graph model
• From inhomogeneous random digraphs to random graphs with fixed arc counts
• Linear-time multilevel graph partitioning via edge sparsification

This page was built for publication: Efficient generation of networks with given expected degrees

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