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 $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 Diaconis and Stroock [ Annals of Applied Probability 1991], 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 Cooper, Dyer and Greenhill [ Combinatorics, Probability and Computing 2007], but with significant extension required.

[1]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[2]  J. Besag,et al.  Generalized Monte Carlo significance tests , 1989 .

[3]  Brendan D. McKay,et al.  Uniform Generation of Random Regular Graphs of Moderate Degree , 1990, J. Algorithms.

[4]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[5]  Alistair Sinclair,et al.  Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.

[6]  Alistair Sinclair,et al.  Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.

[7]  P. Diaconis,et al.  COMPARISON THEOREMS FOR REVERSIBLE MARKOV CHAINS , 1993 .

[8]  Tomasz Luczak,et al.  Stratigraphy of a Random Acyclic Directed Graph: The Size of Trophic Levels in the Cascade Model , 1993 .

[9]  A. Rao,et al.  A Markov chain Monte carol method for generating random (0, 1)-matrices with given marginals , 1996 .

[10]  Prasad Tetali,et al.  Simple Markov-chain algorithms for generating bipartite graphs and tournaments , 1997, SODA '97.

[11]  P. Diaconis,et al.  Algebraic algorithms for sampling from conditional distributions , 1998 .

[12]  Ronald L. Graham,et al.  Statistical Problems Involving Permutations With Restricted Positions , 1999 .

[13]  John M. Roberts.  Simple methods for simulating sociomatrices with given marginal totals , 2000, Soc. Networks.

[14]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[15]  Olle Häggström.  Finite Markov Chains and Algorithmic Applications , 2002 .

[16]  M. Newman,et al.  On the uniform generation of random graphs with prescribed degree sequences , 2003, cond-mat/0312028.

[17]  Martin E. Dyer,et al.  Sampling regular graphs and a peer-to-peer network , 2005, SODA '05.

[18]  Christian Schindelhauer,et al.  Peer-to-peer networks based on random transformations of connected regular undirected graphs , 2005, SPAA '05.

[19]  Amin Saberi,et al.  A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[20]  Christian Schindelhauer,et al.  Distributed random digraph transformations for peer-to-peer networks , 2006, SPAA '06.

[21]  R. Gentleman,et al.  Coverage and error models of protein-protein interaction data by directed graph analysis , 2007, Genome Biology.

[22]  Helmut Prodinger,et al.  Generating Random Derangements , 2008, ANALCO.

[23]  Martin E. Dyer,et al.  The flip markov chain and a randomising P2P protocol , 2009, PODC '09.

[24]  Antonio Carzaniga,et al.  Uniform Sampling for Directed P2P Networks , 2009, Euro-Par.

[25]  Michael Drew Lamar.  On uniform sampling simple directed graph realizations of degree sequences , 2009, ArXiv.

[26]  Peng Wang,et al.  Closure, connectivity and degree distributions: Exponential random graph (p*) models for directed social networks , 2009, Soc. Networks.

[27]  Matthias Müller-Hannemann,et al.  Uniform Sampling of Digraphs with a Fixed Degree Sequence , 2010, WG.

[28]  Zoltán Toroczkai,et al.  A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs , 2009, Electron. J. Comb..

[29]  Kevin E. Bassler,et al.  Constructing and sampling directed graphs with given degree sequences , 2011, ArXiv.