Uniform generation of random graphs with power-law degree sequences

zbMath1403.05136arXiv1709.02674MaRDI QIDQ4608003

Pu Gao, Nicholas C. Wormald

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1709.02674

zbMATH Keywords

linear-time algorithmgraph sampling

Mathematics Subject Classification ID

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

Related Items (5)

Mixing time of the switch Markov chain and stable degree sequences ⋮ Fast uniform generation of random graphs with given degree sequences ⋮ Random graphs with given vertex degrees and switchings ⋮ The mixing time of switch Markov chains: a unified approach ⋮ Uniform generation of spanning regular subgraphs of a dense graph

This page was built for publication: Uniform generation of random graphs with power-law degree sequences