Uniform generation of random regular graphs of moderate degree
From MaRDI portal
Publication:3495665
Recommendations
Cited in
(67)- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- On the independence and chromatic numbers of random regular graphs
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
- Game theoretical modelling of a dynamically evolving network. I: General target sequences
- The switch Markov chain for sampling irregular graphs and digraphs
- Rejection sampling of bipartite graphs with given degree sequence
- Generating regular directed graphs
- Sampling hypergraphs with given degrees
- Uniform generation of \(d\)-factors in dense host graphs
- The average distance and the diameter of dense random regular graphs
- Sampling k-partite graphs with a given degree sequence
- Uniform generation of spanning regular subgraphs of a dense graph
- Approximate counting of regular hypergraphs
- Mixing time of the switch Markov chain and stable degree sequences
- Random regular graphs of high degree
- The replica symmetric solution for orthogonally constrained Heisenberg model on Bethe lattice
- Uniform sampling of digraphs with a fixed degree sequence
- On the effective generation of set elements within specified ranges
- scientific article; zbMATH DE number 4160788 (Why is no real title available?)
- Counting and selecting at random bipartite graphs with fixed degrees
- Subgraphs of random k-edge-coloured k-regular graphs
- The probability that a random multigraph is simple
- Generating 4-regular Hamiltonian plane graphs
- Short cycle distribution in random regular graphs recursively generated by pegging
- Exact sampling and counting for fixed-margin matrices
- Random Graph Processes with Degree Restrictions
- Araneola: a scalable reliable multicast system for dynamic environments
- Configuring random graph models with fixed degree sequences
- The cook-book approach to the differential equation method
- Generating Random Regular Graphs Quickly
- On the asymmetry of random regular graphs and random graphs
- Expanders Are Universal for the Class of All Spanning Trees
- Analyzing local and global properties of multigraphs
- Uniform generation of random regular graphs
- Dirac's theorem for random regular graphs
- Moments of uniform random multigraphs with fixed degree sequences
- Random graphs with given vertex degrees and switchings
- Directed random graphs with given degree distributions
- A note on dynamical models on random graphs and Fokker-Planck equations
- Density decompositions of networks
- Edge correlations in Random regular hypergraphs and applications to subgraph testing
- Loose Hamilton Cycles in Regular Hypergraphs
- Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example
- On the Chromatic Number of Random Graphs with a Fixed Degree Sequence
- Generating Outerplanar Graphs Uniformly at Random
- Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees
- Expanders are universal for the class of all spanning trees
- A separator-based method for generating weakly chordal graphs
- Generating random regular graphs
- Generating random regular graphs
- Generating random regular graphs
- A sequential algorithm for generating random graphs
- 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
- Linear-time uniform generation of random sparse contingency tables with specified marginals
- Uniform generation of temporal graphs with given degrees
- Approximate sampling and counting of graphs with near-regular degree intervals
- Tight frames generated by a graph short-time Fourier transform
- Sampling Random Graphs with Specified Degree Sequences
- Feature-based network construction: from sampling to what-if analysis
- Induced subgraph in random regular graph
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Generating simple random graphs with prescribed degree distribution
- Small subgraphs of random regular graphs
- A transition of limiting distributions of large matchings in random graphs
- Fast uniform generation of regular graphs
This page was built for publication: Uniform generation of random regular graphs of moderate degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495665)
