On the switch markov chain for perfect matchings
Pages 1972 - 1983
Abstract
We study a simple Markov chain, the switch chain, on the set of all perfect matchings in a bipartite graph. This Markov chain was proposed by Diaconis, Graham and Holmes as a possible approach to a sampling problem arising in Statistics. They considered several classes of graphs, and conjectured that the switch chain would mix rapidly for graphs in these classes. Here we settle their conjecture almost completely. We ask: for which graph classes is the Markov chain ergodic and for which is it rapidly mixing? We provide a precise answer to the ergodicity question and close bounds on the mixing question. We show for the first time that the mixing time of the switch chain is polynomial in the class of monotone graphs. This class was identified by Diaconis, Graham and Holmes as being of particular interest in the statistical setting.
References
[1]
D. Aldous and J. A. Fill, Reversible Markov chains and random walks on graphs, 2002. http://www.stat.berkeley.edu/~aldous/RWG/book.html. Unfinished monograph, recompiled 2014.
[2]
I. Bezáková, D. Stefankovic, V. V. Vazirani, and E. Vigoda, Accelerating simulated annealing for the permanent and combinatorial counting problems, SIAM Journal on Computing, 37 (2008), pp. 1429--1454.
[3]
N. Bhatnagar, D. Randall, V. Vazirani, and E. Vigoda, Random bichromatic matchings, in LATIN 2006: Theoretical Informatics, vol. 3887 of Lecture Notes in Computer Science, Springer, 2006, pp. 190--201.
[4]
O. Blumberg, Permutations with interval restrictions, PhD thesis, Stanford University, 2012.
[5]
K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Journal of Computer and System Sciences, 13 (1976), pp. 335--379.
[6]
A. Brandstädt, V. B. Le, and J. P. Spinrad, Graph Classes: A Survey, vol. 3 of Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, 1999.
[7]
M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The strong perfect graph theorem, Annals of Mathematics, 164 (2006), pp. 51--229.
[8]
P. Diaconis, R. Graham, and S. P. Holmes, Statistical problems involving permutations with restricted positions, in State of the art in probability and statistics, vol. 36 of Lecture Notes--Monograph Series, Institute of Mathematical Statistics, 2001, pp. 195--222.
[9]
M. Dyer, M. Jerrum, and H. Müller, On the switch Markov chain for perfect matchings, 2015. http://arxiv.org/abs/1501.07725
[10]
B. Efron and V. Petrosian, Nonparametric methods for doubly truncated data, Journal of the American Statistical Association, 94 (1999), pp. 824--834.
[11]
F. Glover, Maximum matching in a convex bipartite graph, Naval Research Logistics Quarterly, 14 (1967), pp. 313--316.
[12]
M. C. Golumbic, Algorithmic graph theory and perfect graphs, vol. 57 of Annals of Discrete Mathematics, North-Holland, Amsterdam, 2004.
[13]
J. E. Goodman, J. Pach, and C. K. Yap, Mountain climbing, ladder moving, and the ring width of a polygon, Amer. Math. Monthly, 96 (1989), pp. 494--510.
[14]
M. Jerrum, Counting, sampling and integrating: algorithms and complexity, ETH Zürich Lectures in Mathematics, Birkhäuser, Basel, 2003.
[15]
M. Jerrum and A. Sinclair, Approximating the permanent, SIAM Journal on Computing, 18 (1989), pp. 1149--1178.
[16]
M. Jerrum, A. Sinclair, and E. Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries, Journal of the ACM, 51 (2004), pp. 671--697.
[17]
M. Jerrum, L. Valiant, and V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoretical Computer Science, 43 (1986), pp. 169--188.
[18]
T. Keleti, The mountain climbers' problem, Proceedings of the American Mathematical Society, 117 (1993), pp. 89--97.
[19]
V. B. Le, On opposition graphs, coalition graphs, and bipartite permutation graphs, Discrete Applied Mathematics, 168 (2014), pp. 26--33.
[20]
D. A. Levin, Y. Peres, and E. L. Wilmer, Markov chains and mixing times, American Mathematical Society, 2006.
[21]
A. Lubiw, Doubly lexical orderings of matrices, SIAM Journal on Computing, 16 (1987), pp. 854--879.
[22]
J. Matthews, Markov chains for sampling matchings, PhD thesis, Edinburgh University, 2008.
[23]
Y. Okamoto, R. Uehara, and T. Uno, Counting the number of matchings in chordal and chordal bipartite graph classes, in Graph-Theoretic Concepts in Computer Science, vol. 5911 of Lecture Notes in Computer Science, Springer, 2010, pp. 296--307.
[24]
I. Pak, Lectures on discrete and polyhedral geometry, 2010. http://www.math.ucla.edu/~pak/geompol8.pdf
[25]
A. Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combinatorics Probability and Computing, 1 (1992), pp. 351--370.
[26]
J. Spinrad, A. Brandstädt, and L. Stewart, Bipartite permutation graphs, Discrete Applied Mathematics, 18 (1987), pp. 279 -- 292.
[27]
J. P. Spinrad, Efficient Graph Representations, Fields Institute monographs, The Fields Institute for Research in Mathematical Sciences, American Mathematical Soc., 2003.
[28]
A. Tucker, The parallel climbers puzzle, Math Horizons (1995), pp. 22--24.
[29]
R. Uehara, Linear time algorithms on chordal bipartite and strongly chordal graphs, in Automata, Languages and Programming, 29th International Colloquium, 2002, pp. 993--1004.
[30]
L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science, 8 (1979), pp. 189--201.
[31]
D. B. West, Introduction to Graph Theory, Prentice Hall, 2nd ed., 2001.
[32]
M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Alg. Disc. Meth., 2 (1981), pp. 77--79.
- On the switch markov chain for perfect matchings
Recommendations
On the Switch Markov Chain for Perfect Matchings
We study a simple Markov chain, the switch chain, on the set of all perfect matchings in a bipartite graph. This Markov chain was proposed by Diaconis, Graham and Holmes as a possible approach to a sampling problem arising in Statistics. We ask: for ...
Counting Perfect Matchings and the Switch Chain
We examine the problem of exactly or approximately counting all perfect matchings in hereditary classes of nonbipartite graphs. In particular, we consider the switch Markov chain of Diaconis, Graham, and Holmes. We determine the largest hereditary class ...
Pseudo-marginal Markov Chain Monte Carlo for Nonnegative Matrix Factorization
A pseudo-marginal Markov chain Monte Carlo (PMCMC) method is proposed for nonnegative matrix factorization (NMF). The sampler jointly simulates the joint posterior distribution for the nonnegative matrices and the matrix dimensions which indicate the ...
Comments
Information & Contributors
Information
Published In
Sponsors
- SIAM Activity Group on Discrete Mathematics
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Published: 10 January 2016
Check for updates
Qualifiers
- Research-article
Conference
SODA '16
Sponsor:
Acceptance Rates
Overall Acceptance Rate 411 of 1,322 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 76Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 31 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in