New classes of degree sequences with fast mixing swap Markov chain sampling

  title={New classes of degree sequences with fast mixing swap Markov chain sampling},
  author={P{\'e}ter L. Erd{\"o}s and Istv{\'a}n Mikl{\'o}s and Zolt{\'a}n Toroczkai},
  journal={Combinatorics, Probability & Computing},
In network modeling of complex systems one is often required to sample random realizations of networks that obey a given set of constraints, often in form of graph measures. A much studied class of problems targets uniform sampling of simple graphs with given degree sequence or also with given degree correlations expressed in the form of a joint degree matrix. One approach is to use Markov chains based on edge switches (swaps) that preserve the constraints, are irreducible (ergodic) and fast… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 6 times over the past 90 days. VIEW TWEETS


Publications referenced by this paper.
Showing 1-10 of 52 references


  • P. L. Erdős
  • Miklós and Z. Toroczkai A decomposition based…
  • 2015
Highly Influential
9 Excerpts

Canonical decomposition of a graph

  • R. Tyshkevich
  • (in Russian) Doklady Akademii Nauk BSSR XXIV 8
  • 1980
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…