The mixing time of switch Markov chains: A unified approach

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. Among the applications of this general result is an almost uniform sampler for power-law and heavy-tailed degree sequences. Another application 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 5 logn n−1 .

[1]  Eric Vigoda,et al.  On Counting Perfect Matchings in General Graphs , 2017, LATIN.

[2]  Catherine S. Greenhill,et al.  The switch Markov chain for sampling irregular graphs and digraphs , 2017, Theor. Comput. Sci..

[3]  Eric Vigoda,et al.  Sampling binary contingency tables with a greedy start , 2007 .

[4]  Daniel J. Kleitman,et al.  Algorithms for constructing graphs and digraphs with given valences and factors , 1973, Discret. Math..

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

[6]  Catherine S. Greenhill.  A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs , 2011, Electron. J. Comb..

[7]  Pu Gao,et al.  Uniform generation of random graphs with power-law degree sequences , 2017, SODA.

[8]  Pieter Kleer,et al.  Rapid mixing of the switch Markov chain for strongly stable degree sequences , 2020, Random Struct. Algorithms.

[9]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[10]  S. Hakimi.  On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .

[11]  H. Ryser.  Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

[12]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[13]  J. Petersen.  Die Theorie der regulären graphs , 1891 .

[14]  Zoltán Toroczkai,et al.  A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix , 2015, SIAM J. Discret. Math..

[15]  Michael Drew Lamar,et al.  Directed 3-cycle anchored digraphs and their application in the uniform sampling of realizations from a fixed degree sequence , 2011, Proceedings of the 2011 Winter Simulation Conference (WSC).

[16]  Martin E. Dyer,et al.  On the Switch Markov Chain for Perfect Matchings , 2015, SODA.

[17]  Tao Jia,et al.  Control Capacity and A Random Sampling Method in Exploring Controllability of Complex Networks , 2013, Scientific Reports.

[18]  Alistair Sinclair,et al.  Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions , 2004, SIAM J. Comput..

[19]  Catherine S. Greenhill.  The switch Markov chain for sampling irregular graphs (Extended Abstract) , 2014, SODA.

[20]  Martin E. Dyer,et al.  Polynomial-time counting and sampling of two-rowed contingency tables , 2000, Theor. Comput. Sci..

[21]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[22]  P. Erdős,et al.  Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs , 2018, PloS one.

[23]  Catherine S. Greenhill,et al.  Mixing time of the switch Markov chain and stable degree sequences , 2020, Discret. Appl. Math..

[24]  Mark Jerrum,et al.  Fast Uniform Generation of Regular Graphs , 1990, Theor. Comput. Sci..

[25]  István Miklós,et al.  Approximate Counting of Graphical Realizations , 2015, PloS one.

[26]  István Miklós,et al.  A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing , 2019, ArXiv.

[27]  Nicholas Wormald,et al.  Enumeration of graphs with a heavy-tailed degree sequence , 2014, 1404.1250.

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

[29]  Eric Vigoda,et al.  Sampling binary contingency tables with a greedy start , 2006, SODA '06.

[30]  Yee Lian Chew,et al.  Network control principles predict neuron function in the Caenorhabditis elegans connectome , 2017, Nature.

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

[32]  P. ErdHos,et al.  Efficiently sampling the realizations of irregular, but linearly bounded bipartite and directed degree sequences , 2017, 1712.01709.

[33]  Prasad Tetali,et al.  Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract) , 1999, SODA.

[34]  Zoltán Toroczkai,et al.  New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling , 2016, Combinatorics, Probability and Computing.

[35]  István Miklós,et al.  Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence , 2010, Electron. J. Comb..

[36]  Zoltán Király,et al.  On the Swap-Distances of Different Realizations of a Graphical Degree Sequence , 2013, Comb. Probab. Comput..

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

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

[39]  D. Gale.  A theorem on flows in networks , 1957 .