Efficient Generation of Networks with Given Expected Degrees
From MaRDI portal
Publication:3005576
DOI10.1007/978-3-642-21286-4_10zbMath1328.05183OpenAlexW111167761WikidataQ59617039 ScholiaQ59617039MaRDI QIDQ3005576
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
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Efficient sampling methods for discrete distributions, Generating large scale‐free networks with the Chung–Lu random graph model, Geometric inhomogeneous random graphs, Exact sublinear binomial sampling, Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities, Sampling Geometric Inhomogeneous Random Graphs in Linear Time, Limitations of Chung Lu random graph generation, Parameterized clique on inhomogeneous random graphs