A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs
A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs
The switch chain is a well-known Markov chain for sampling directed graphs with a given degree sequence. While not ergodic in general, we show that it is ergodic for regular degree sequences. We then prove that the switch chain is rapidly mixing for regular directed graphs of degree $d$, where …