rapid mixing

A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing

One of the simplest methods of generating a random graph with a given degree sequence is provided by the Monte Carlo Markov Chain method using __swaps__. The swap Markov chain converges to the uniform distribution, but generally it is not known …

The mixing time of switch Markov chains: a unified approach

We show that the switch Markov chain is rapidly mixing on $P$-stable degree sequences of simple, bipartite, and directed graphs. Consequently, we have rapid mixing on power-law distribution-bounded degree sequences with parameter $\gamma2$ and on …

Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs

Since 1997 a considerable effort has been spent on the study of the **swap** (switch) Markov chains on graphic degree sequences. All of these results assume some kind of regularity in the corresponding degree sequences. Recently, Greenhill and …