The mixing time of the switch Markov chains: a unified approach

Abstract

Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on the realizations of graphic degree sequences of simple graphs. Several results were proved on rapidly mixing Markov chains on unconstrained, bipartite, and directed sequences, using different mechanisms. The aim of this paper is to unify these approaches. We will illustrate the strength of the unified method by showing that on any $P$-stable family of unconstrained/bipartite/directed degree sequences the switch Markov chain is rapidly mixing. This is a common generalization of every known result that shows the rapid mixing nature of the switch Markov chain on a region of degree sequences. Two applications of this general result will be presented. One is an almost uniform sampler for power-law degree sequences with exponent $\gamma >1+\sqrt{3}$. The other one shows that the switch Markov chain on the degree sequence of an Erdős-Rényi random graph $G(n,p)$ is asymptotically almost surely rapidly mixing if $p$ is bounded away from 0 and 1 by at least $\frac{5\log n}{n-1}$.

final review

References in corpus (1)

• The switch Markov chain for sampling irregular graphs

Cited by in corpus (7)

• Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees
• Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates
• Polaris: Sampling from the Multigraph Configuration Model with Prescribed Color Assortativity
• Approximate Sampling of Graphs with Near-$P$-stable Degree Intervals
• Degree-preserving graph dynamics -- a versatile process to construct random networks
• Fully graphic degree sequences and P-stable degree sequences
• Cutoff for Rewiring Dynamics on Perfect Matchings