A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs (Q665755)

Summary: 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 \(d\) is any positive integer-valued function of the number of vertices. We bound the mixing time by bounding the eigenvalues of the chain. A new result is presented and applied to bound the smallest (most negative) eigenvalue. This result is a modification of a lemma by \textit{P. Diaconis} and \textit{D. Stroock} [Ann. Appl. Probab. 1, No. 1, 36--61 (1991; Zbl 0731.60061)], and by using it we avoid working with a lazy chain. A multicommodity flow argument is used to bound the second-largest eigenvalue of the chain. This argument is based on the analysis of a related Markov chain for undirected regular graphs by \textit{C. Cooper}, \textit{M. Dyer} and \textit{C. Greenhill} [Comb. Probab. Comput. 16, No. 4, 557--593 (2007; Zbl 1137.05065)], but with significant extension required.