Uniform generation of random regular graphs of moderate degree
From MaRDI portal
Publication:3495665
DOI10.1016/0196-6774(90)90029-EzbMath0711.68082OpenAlexW2049807504MaRDI QIDQ3495665
Brendan D. McKay, Nicholas C. Wormald
Publication date: 1990
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(90)90029-e
Related Items
Moments of Uniform Random Multigraphs with Fixed Degree Sequences, On the asymmetry of random regular graphs and random graphs, Generating simple random graphs with prescribed degree distribution, Analyzing local and global properties of multigraphs, Random Graph Processes with Degree Restrictions, Mixing time of the switch Markov chain and stable degree sequences, Exact sampling and counting for fixed-margin matrices, A sequential algorithm for generating random graphs, Small subgraphs of random regular graphs, Game theoretical modelling of a dynamically evolving network. I: General target sequences, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Fast uniform generation of random graphs with given degree sequences, Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs, A transition of limiting distributions of large matchings in random graphs, The average distance and the diameter of dense random regular graphs, The replica symmetric solution for orthogonally constrained Heisenberg model on Bethe lattice, Loose Hamilton Cycles in Regular Hypergraphs, Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example, The switch Markov chain for sampling irregular graphs and digraphs, Fast uniform generation of regular graphs, Araneola: a scalable reliable multicast system for dynamic environments, Random graphs with given vertex degrees and switchings, Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums, Approximate counting of regular hypergraphs, The cook-book approach to the differential equation method, Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\), Subgraphs of Randomk-Edge-Colouredk-Regular Graphs, Rejection sampling of bipartite graphs with given degree sequence, On the independence and chromatic numbers of random regular graphs, Sampling hypergraphs with given degrees, The Probability That a Random Multigraph is Simple, Configuring Random Graph Models with Fixed Degree Sequences, Random regular graphs of high degree, Expanders Are Universal for the Class of All Spanning Trees, A note on dynamical models on random graphs and Fokker-Planck equations, Uniform generation of \(d\)-factors in dense host graphs, Uniform Sampling of Digraphs with a Fixed Degree Sequence, On the Chromatic Number of Random Graphs with a Fixed Degree Sequence, Short cycle distribution in random regular graphs recursively generated by pegging, Induced subgraph in random regular graph, Uniform Generation of Random Regular Graphs, Density decompositions of networks, Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing, Dirac’s theorem for random regular graphs, Directed random graphs with given degree distributions, Uniform generation of spanning regular subgraphs of a dense graph, A separator-based method for generating weakly chordal graphs, Unnamed Item, On the effective generation of set elements within specified ranges, Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
