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

@article{Erds2018NewCO,
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},
year={2018},
volume={27},
pages={186-207}
}

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