Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices

We show that the switch Markov chain for sampling simple undirected, as well as bipartite, graphs with a given degree sequence is rapidly mixing when the degree sequence is strongly stable. Strong stability is closely related to the notion of P-stability introduced by Jerrum and Sinclair (1990), and is satisfied by all degree sequences for which the switch chain is known to be rapidly mixing based on Sinclair's multicommodity flow method. Our approach relies on a comparison argument with a Markov chain defined by Jerrum and Sinclair for sampling graphs that almost have a given degree sequence. This comparison provides a much shorter proof for the currently known rapid mixing results of the switch chain and extends them up to sharp characterizations of P-stability in terms of certain graph parameters. In particular, our work resolves an open problem posed by Greenhill and Sfragara (2017) regarding the switch chain on undirected graphs.

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

[2]  Amin Saberi,et al.  A Sequential Algorithm for Generating Random Graphs , 2007, Algorithmica.

[3]  Eric Vigoda,et al.  Random Bichromatic Matchings , 2006, LATIN.

[4]  Priya Mahadevan,et al.  Systematic topology analysis and generation using degree correlations , 2006, SIGCOMM.

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

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

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

[8]  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..

[9]  Martin E. Dyer,et al.  The flip Markov chain for connected regular graphs , 2019, Discret. Appl. Math..

[10]  S. Louis Hakimi,et al.  Relations between graphs and integer-pair sequences , 1976, Discret. Math..

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

[12]  Martin Dyer,et al.  Corrigendum: Sampling regular graphs and a peer-to-peer network , 2012 .

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

[14]  Leo van Iersel,et al.  Graph Realizations Constrained by Skeleton Graphs , 2017, Electron. J. Comb..

[15]  Minas Gjoka,et al.  Construction of simple graphs with a target joint degree matrix and beyond , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[16]  Isabelle Stanton,et al.  Constructing and sampling graphs with a prescribed joint degree distribution , 2011, JEAL.

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

[18]  Milena Mihail,et al.  Graphic Realizations of Joint-Degree Matrices , 2015, ArXiv.

[19]  Persi Diaconis,et al.  A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees , 2011, Internet Math..

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

[21]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.

[22]  J. Whittaker.  A Mountain-Climbing Problem , 1966, Canadian Journal of Mathematics.

[23]  A theorem on continuous functions , 1952 .

[24]  Pieter Kleer,et al.  Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence , 2018, APPROX-RANDOM.

[25]  Vicenç Torra,et al.  Improving the characterization of P-stability for applications in network privacy , 2016, Discret. Appl. Math..

[26]  Brendan D. McKay,et al.  Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2) , 1991, Comb..

[27]  Milena Mihail,et al.  Connected realizations of joint-degree matrices , 2018, Discret. Appl. Math..

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

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

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

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

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

[33]  István Miklós,et al.  On realizations of a joint degree matrix , 2015, Discret. Appl. Math..

[34]  V. Climenhaga.  Markov chains and mixing times , 2013 .

[35]  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).

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

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

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