Simple deterministic approximation algorithms for counting matchings

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 122-127

  Bayati, Mohsen ^a   Gamarnik, David ^b   Katz, Dimitriy ^b   Nair, Chandra ^c   Tetali, Prasad ^d  

^a STANFORD UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c MICROSOFT RESEARCH   (United States)

^d GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Correlation decay; FPTAS; Matching; Partition function

Indexed keywords

CORRELATION DECAY; PARTITION FUNCTION;

CORRELATION THEORY; GRAPH THEORY; PATTERN MATCHING; SET THEORY; STATISTICAL METHODS;

APPROXIMATION ALGORITHMS;

EID: 35448970586     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250809     Document Type: Conference Paper

References (24)

1. A. Bandyopadhyay and D. Gamarnik, Counting without sampling. New algorithms for enumeration problems using statistical physics., Proceedings of 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006.
2. N. Berger, C. Kenyon, E. Mossel, and Y. Peres, Glauber dynamics on trees and hyperbolic graphs, Proc. 42nd IEEE Symposium on Foundations of Computer Science (2001).
3. M. Bayati and C. Nair, A rigorous proof of cavity method for counting matchings, Annual Allerton Conference on Communication, Control and Computing, 2006.
4. R. L. Dobrushin, Prescribing a system of random variables by the help of conditional distributions, Theory of Probability and its Applications 15 (1970), 469-497.
5. M. Dyer, A. Sinclair, E. Vigoda, and D. Weitz, Mixing in time and space for lattice spin systems: a combinatorial view, Random Struct. & Alg. 24 (2004), 461-479.
6. D. Gamarnik and D. Katz, Correlation decay and deterministic FPTAS for counting list-colorings of a graph, Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007.
7. _, A deterministic approximation algorithm for computing a permanent of a 0,1 matrix, Preprint on http://arxiv.org/abs/math.CO/0702039 (2007).
8. L. A. Goldberg, R. Martin, and M. Paterson, Strong spatial mixing with fewer colors for lattice graphs, SIAM J. Comput. 35 (2005), no. 2, 486-517.
9. C. D. Godsil, Matchings and walks in graphs, J. Graph Th. 5 (1981), 285-297.
10. O.J.Heilman and E.H.Lieb, Theory of monomer-dimer systems, Comm. Math. Phys. 25 (1972), 190-232.
11. M. Jerrum, Counting, sampling and integrating: algorithms and complexity, Lectures in Mathematics, ETH-Zurich, Birkhauser Verlag (2003).
12. M. Jerrum and A. Sinclair, The Markov chain Monte Carlo method: an approach to approximate counting and integration, Approximation algorithms for NP-hard problems (D. Hochbaum, ed.), PWS Publishing Company, Boston, MA, 1997.
13. K. Jung and D. Shah, Inference in Binary Pair-wise Markov Random Field through Self-Avoiding Walk, Preprint on http://arxiv.org/abs/cs.AI/ 0610111v2.
14. M. Jerrum, A. Sinclair, and E. Vigoda, A polynomial-time approximation algorithms for permanent of a matrix with non-negative entries, Journal of the Association for Computing Machinery 51 (2004), no. 4, 671-697.
15. M. Jerrum, L. Valiant, and V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoret. Comput. Sei. 43 (1986), no. 2-3, 169188.
16. J. Kahn and J. H. Kim, Random matchings in regular graphs, Combinatorica 8 (1998), 201-226.
17. N. Linial, A. Samorodnitsky, and A. Wigderson, A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents, Combinatorica, 20 (2000), no. 4, 545-568.
18. A. Montanari and G. Semerjian, Rigorous inequalities between length and time scales in glassy systems, Preprint in arXiv.org (2006).
19. C. Nair and P. Tetali, The correlation decay (CD) tree and strong spatial mixing in multi-spin systems, Preprint on http://front.math.ucdavis. edu/math.PR/0701494.
20. A. Sinclair, Algorithms for random generation and counting: a Markov chain approach, Birkhauser Progress in Theoretical Computer Science Series, Birkhauser Verlag (1993).
21. S. Vadhan, The complexity of counting in sparse, regular, and planar graphs, SIAM Journal on Computing 31 (2001), no. 2, pp. 398-427.
22. L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science, 8 (1979), 189-201.
23. J. van den Berg, On the absence of phase transition in the monomer-dimer model, CWI reports, PNA-R9813, ISSN 1386-3711 (1998).
24. D. Weitz, Counting independent sets up to the tree threshold, Proc. 38th Ann. Symposium on the Theory of Computing (2006).