Efficient and simple generation of random simple connected graphs with prescribed degree sequence

DOI10.1093/COMNET/CNV013MaRDI QIDQ4689375zbMATH OpenOpenAlexFDO

Authors Fabien Viger, Matthieu Latapy

Publication date 16 October 2018

Published in Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comnet/cnv013

zbMATH Keywords

mathematical and numerical analysis of networksnetwork theory and computer sciencesstructural analysis of networks

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computing and Combinatorics
• A sequential algorithm for generating random graphs
• Fast uniform generation of random graphs with given degree sequences
• Generating simple random graphs with prescribed degree distribution
• Generating graphs randomly

Cited in

(16)

• A sequential importance sampling algorithm for generating random graphs with prescribed degrees
• Efficient generation of networks with given expected degrees
• I/O-efficient generation of massive graphs following the \textit{LFR} benchmark
• Generating graphs randomly
• Generating maximally disassortative graphs with given degree distribution
• Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees
• Controlled Markovian dynamics of graphs: unbiased generation of random graphs with prescribed topological properties
• Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees
• Computing and Combinatorics
• Fast sequential creation of random realizations of degree sequences
• Generating random regular graphs
• Universality in Anderson localization on random graphs with varying connectivity
• Generation of networks with prescribed degree-dependent clustering
• Reccs: realistic cluster connectivity simulator for synthetic network generation
• A method for generating connected Erdős-Rényi random graphs
• Generating simple random graphs with prescribed degree distribution

This page was built for publication: Efficient and simple generation of random simple connected graphs with prescribed degree sequence

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