A decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix

SIAM Journal on Discrete Mathematics

Volumn 29, Issue 1, 2015, Pages 481-499

  Erdos, Péter L ^a   Miklós, István ^a   Toroczkai, Zoltán ^b,c  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^b UNIVERSITY OF NOTRE DAME   (United States)

^c MAX PLANCK INSTITUT FÜR PHYSIK KOMPLEXER SYSTEME   (Germany)

Author keywords

Graph sampling; Joint degree matrix; Rapidly mixing Markov chains

Indexed keywords

CHAINS; FACTORIZATION; MARKOV PROCESSES; MIXING; MONTE CARLO METHODS; THEOREM PROVING;

BALANCED REALIZATIONS; CHEEGER INEQUALITIES; DEGREE SEQUENCE; FACTORIZATION THEOREMS; GRAPH SAMPLINGS; MARKOV CHAIN MONTE CARLO ALGORITHMS; RAPIDLY MIXING; SPECTRAL GAP;

MATRIX ALGEBRA;

EID: 84925351340     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/130929874     Document Type: Article

References (33)

1. Y. AMANATIDIS, B. GREEN, AND M. MIHAIL, Flexible models for complex networks, presented at Annual Conference on Discrete Mathematics, SIAM, Philadelphia, 2008; available online from http://www.cc.gatech.edu/home/mihail/D.vita/ARC2poster.ppt.
2. I. BEZÁKOVÁ, N. BHATNAGAR, AND E. VIGODA, Sampling binary contingency tables with a greedy start, Random Structures Algorithms, 30 (2007), pp. 168-205.
3. I. BEZÁKOVÁ, Sampling binary contingency tables, Comput. Sci. Eng., 10 (2008), pp. 26-31.
4. I. BEZÁKOVÁ, N. BHATNAGAR, AND D. RANDALL, On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries, J. Comb. Optim. 22 (2011), pp. 457-468.
5. I. BEZÁKOVÁ, A. SINCLAIR, D. STEFANKOVIC, AND E. VIGODA, Negative examples for sequential importance sampling of binary contingency tables, Algorithmica, 64 (2012), pp. 606-620.
6. J. BLANCHET, Importance sampling and efficient counting for binary contingency tables, Ann. Appl. Probab., 19, (2009), pp. 949-982.
7. S. CARACCIOLO, A. PELISSETTO, AND A. D. SOKAL, Two Remarks on Simulated Tempering, manuscript.
8. Y. CHEN, P. DIACONIS, S.P. HOLMES, AND J.S. LIU, Sequential Monte Carlo methods for statistical analysis of tables, J. Amer. Statist. Assoc., 100 (2005), pp. 109-120.
9. C. COOPER, M. DYER, AND C. GREENHILL, Sampling regular graphs and a peer-to-peer network, Comp. Prob. Comp., 16 (2007), pp. 557-593.
10. M. CRYAN, M. DYER, L.A. GOLDBERG, M. JERRUM, AND R. A. MARTIN, Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows, SIAM J. Comput., 36 (2006), pp. 247-278.
11. M. CRYAN, M.E. DYER, AND D. RANDALL, Approximately counting integral flows and cellbounded contingency tables, SIAM J. Comput., 39 (2010), pp. 2683-2703.
12. É. CZABARKA, A. DUTLE, P.L. ERDO{combining double acute accent}S, AND I. MIKLÓS, On realizations of a joint degree matrix, Discrete Appl. Math., 181 (2015), pp. 283-288.
13. C.I. DEL GENIO, H. KIM, Z. TOROCZKAI, AND K.E. BASSLER, Efficient and exact sampling of simple graphs with given arbitrary degree sequence, PLoS ONE, 5 (2010), e10012.
14. P. DIACONIS AND A. GANGOLLI, Rectangular arrays with fixed margins, in Discrete Probability and Algorithms, D. Aldous et al., eds., Springer-Verlag, New York, 1995, pp. 15-41.
15. P. DIACONIS AND L. SALOFF-COSTE, Comparison theorems for reversible Markov chains, Ann. Appl. Probab., 3 (1993), pp. 696-730.
16. P. DIACONIS AND D. STROOCK, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab., 1 (1991), pp. 36-61.
17. P.L. ERDO{combining double acute accent}S, Z.S. KISS, I. MIKLÓS, AND L. SOUKUP, Constructing, Sampling and Counting Graphical Realizations of Restricted Degree Sequences, arXiv:1301.7523v2, 2013.
18. T. FEDER, A. GUETZ, M. MIHAIL, AND A. SABERI, A local switch Markov chain on given degree graphs with application in connectivity of peer-to-peer networks, in Proceedings of FOCS'06, 2006, pp. 69-76.
19. M.K. GANAPATHY, Robust Mixing, Ph.D. dissertation, University of Chicago, 2006.
20. C. GREENHILL, A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs, Electron. J. Combin., 16 (2011), pp. 557-593.
21. M. JERRUM AND A. SINCLAIR, Approximating the permanent, SIAM J. Comput., 18 (1989), pp. 1149-1178.
22. M. JERRUM, A. SINCLAIR, AND E. VIGODA, A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries, J. ACM, 51 (2004), pp. 671-697.
23. H. KIM, C.I. DEL GENIO, K.E. BASSLER, AND Z. TOROCZKAI, Constructing and sampling directed graphs with given degree sequences, New J. Phys., 14 (2012), 023012.
24. H. KIM, Z. TOROCZKAI, P.L. ERDO{combining double acute accent}S, I. MIKLÓS, AND L. SZÉKELY, Degree-based graph construction, J. Phys. A, 42 (2009), 392001.
25. R. KANNAN, P. TETALI, AND S. VEMPALA, Simple Markov-chain algorithms for generating bipartite graphs and tournaments, Random Structures Algorithms, 14 (1999), pp. 293-308.
26. Z. KIRÁLY, Recognizing Graphic Degree Sequences and Generating All Realizations, Technical report TR-2011-11, EGRES, 2012, pp. 1-11.
27. R. MADRAS AND D. RANDALL, Markov chain decomposition for convergence rate analysis, Ann. Appl. Probab., 12 (2002), pp. 581-606.
28. R. MARTIN AND D. RANDALL, Disjoint decomposition of Markov chains and sampling circuits in Cayley graphs, Combin. Probab. Comput., 15 (2006), pp. 411-448.
29. I. MIKLÓS, P.L. ERDO{combining double acute accent}S, AND L. SOUKUP, Towards random uniform sampling of bipartite graphs with given degree sequence, Electron. J. Combin., 20 (2013), P16.
30. A.N. PATRINOS AND S.L. HAKIMI, Relations between graphs and integer-pair sequences, Discrete Math., 15 (1976), pp. 347-358.
31. D. RANDALL, Rapidly mixing Markov chains with applications in computer science and physics, Comput. Sci. Eng., 8 (2006), pp. 30-41.
32. A. SINCLAIR, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combin. Probab. Comput., 1 (1992), pp. 351-370.
33. I. STANTON AND A. PINAR, Constructing and sampling graphs with a prescribed joint degree distribution, ACM J. Exp. Algorithms, 17 (2012), 3.5.