Generating random regular graphs

DOI10.1007/s00493-006-0037-7zbMath1121.05110OpenAlexW2610630562MaRDI QIDQ5899329

Jeong Han Kim, Van H. Vu

Publication date: 8 May 2007

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-006-0037-7

zbMATH Keywords

random regular graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (13)

Out-of-equilibrium dynamics and excess volatility in firm networks ⋮ Efficient importance sampling for binary contingency tables ⋮ Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity ⋮ Mixing time of the switch Markov chain and stable degree sequences ⋮ Robustness of random graphs based on graph spectra ⋮ Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs ⋮ The average distance and the diameter of dense random regular graphs ⋮ The switch Markov chain for sampling irregular graphs and digraphs ⋮ Preferential attachment without vertex growth: emergence of the giant component ⋮ Generating Random Networks Without Short Cycles ⋮ Uniform Generation of Random Regular Graphs ⋮ The evolution of the min-min random graph process ⋮ Uniform generation of spanning regular subgraphs of a dense graph

This page was built for publication: Generating random regular graphs