Uniform Sampling of Digraphs with a Fixed Degree Sequence

@inproceedings{Berger2010UniformSO,
  title={Uniform Sampling of Digraphs with a Fixed Degree Sequence},
  author={Annabell Berger and Matthias M{\"u}ller-Hannemann},
  booktitle={WG},
  year={2010}
}
Many applications in network analysis require algorithms to sample uniformly at random from the set of all digraphs with a prescribed degree sequence. We present a Markov chain based approach which converges to the uniform distribution of all realizations. It remains an open challenge whether the Markov chain is rapidly mixing. We also explain in this paper that a popular switching algorithm fails in general to sample uniformly at random because the state graph of the Markov chain decomposes… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

From This Paper

Figures and tables from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

Similar Papers

Loading similar papers…