Generating random regular graphs

DOI10.1145/780542.780576MaRDI QIDQ5901097zbMATH OpenOpenAlexFDO

Authors Jeong Han Kim, Van Vu

Publication date 16 August 2010

Published in Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/780542.780576

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Generating random regular graphs
• Generating Random Regular Graphs Quickly
• Uniform generation of random regular graphs of moderate degree
• Uniform generation of random regular graphs
• Fast uniform generation of regular graphs

Cited in

(27)

• Algorithms for finding knight's tours on Aztec diamonds
• Sequential stub matching for asymptotically uniform generation of directed graphs with a given degree sequence
• Connectivity of random regular graphs generated by the pegging algorithm
• Uniform generation of random regular graphs
• Phase transition in the diffusion and bootstrap percolation models on regular random and Erdős-Rényi networks
• Generating simple random graphs with prescribed degree distribution
• On the asymmetry of random regular graphs and random graphs
• Linear-time uniform generation of random sparse contingency tables with specified marginals
• Araneola: a scalable reliable multicast system for dynamic environments
• Principal eigenvector localization and centrality in networks: revisited
• A sequential algorithm for generating random graphs
• Universal characteristics of deep neural network loss surfaces from random matrix theory
• Generating Random Regular Graphs Quickly
• Bootstrapping on undirected binary networks via statistical mechanics
• Uniform generation of random regular graphs of moderate degree
• Rate of convergence of the short cycle distribution in random regular graphs generated by pegging
• The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks
• Density decompositions of networks
• Lower bounds and a tabu search algorithm for the minimum deficiency problem
• Generating random regular graphs
• Biased opinion dynamics: when the devil is in the details
• Generating Outerplanar Graphs Uniformly at Random
• Packing vertices and edges in random regular graphs
• Fast uniform generation of random graphs with given degree sequences
• Uniform sampling of digraphs with a fixed degree sequence
• Sampling binary contingency tables with a greedy start
• Sandwiching random graphs: universality between random graph models

This page was built for publication: Generating random regular graphs

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