Sampling Random Graphs with Specified Degree Sequences
From MaRDI portal
Cites work
- A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- A sequential algorithm for generating random graphs
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- Configuration models of random hypergraphs
- Configuring random graph models with fixed degree sequences
- Connected components in random graphs with given expected degree sequences
- Distribution of the Estimators for Autoregressive Time Series With a Unit Root
- Enumeration and simulation methods for 0-1 matrices with given marginals
- Fast uniform generation of regular graphs
- scientific article; zbMATH DE number 3654183 (Why is no real title available?)
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- Inference from iterative simulation using multiple sequences
- Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Miscellanea. On quantile estimation and Markov chain Monte Carlo convergence
- Networks. An introduction.
- On the distribution of the sample autocorrelation coefficients
- Sampling Regular Graphs and a Peer-to-Peer Network
- Social and economic networks.
- Some robust exact results on sample autocorrelations and tests of randomness
- The average distances in random graphs with given expected degrees
- The connectivity of graphs of graphs with self-loops and a given degree sequence
- Uniform generation of random regular graphs of moderate degree
Cited in
(2)
This page was built for publication: Sampling Random Graphs with Specified Degree Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892368)
