Accelerating simulated annealing for the permanent and combinatorial counting problems

SIAM Journal on Computing

Volumn 37, Issue 5, 2007, Pages 1429-1454

  Bezáková, Ivona ^a   Štefankovič, Daniel ^b   Vazirani, Vijay V ^c   Vigoda, Eric ^c  

^a Rochester Institute of Technology   (United States)

^b University of Rochester   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

Approximate counting problems; Cooling schedule; Markov chain Monte Carlo; Simulated annealing

Indexed keywords

APPROXIMATE COUNTING PROBLEMS; BIPARTITE GRAPHS; COOLING SCHEDULE; COOLING SCHEDULES; HIGH TEMPERATURES; INTERMEDIATE TEMPERATURES; LOW TEMPERATURES; MARKOV CHAIN MONTE CARLO; MARKOV CHAINS; PERFECT MATCHINGS; SIMULATED ANNEALING ALGORITHMS; TIME ALGORITHMS;

ANNEALING; COMBINATORIAL MATHEMATICS; COOLING; GRAPH THEORY; MARKOV PROCESSES; SCHEDULING ALGORITHMS;

SIMULATED ANNEALING;

EID: 55249105213     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050644033     Document Type: Article

References (19)

1. I. BEZÁKOVA, N. BHATNAGAR, AND E. VIGODA, Sampling binary contingency tables with a greedy start, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM, New York, SIAM, Philadelphia, 2006, pp. 414-423.
2. A. Z. BRODER, How hard is it to marry at random? (On the approximation of the permanent), in Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 1986, pp. 50-58. Erratum in Proceedings of the 20th Annual ACM Symposium on Theory of Computing, ACM, New York, 1988, p. 551.
3. R. BUBLEY AND M. DYER, Path coupling: A technique for proving rapid mixing in Markov chains, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society, Los Alamitos, CA, 1997, pp. 223-231.
4. P. DIACONIS AND D. STROOCK, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab., 1 (1991), pp. 36-61.
5. A. FRIEZE AND E. VIGODA, A survey on the use of Markov chains to randomly sample colorings, in Combinatorics, Complexity and Chance, Grimmett and McDiarmid, eds., Oxford University Press, Oxford, UK, 2007, pp. 53-71.
6. T. HAYES, J. VERA, AND E. VIGODA, Randomly coloring planar graphs with fewer colors than the maximum degree, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 2007, pp. 450-458.
7. T. HAYES AND E. VIGODA, A non-Markovian coupling for randomly sampling colorings, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society, Los Alamitos, CA, 2003, pp. 618-627.
8. M. JERRUM, A very simple algorithm for estimating the number of k-coloring s of a low-degree graph, Random Structures Algorithms, 7 (1995), pp. 157-166.
9. M. JERRUM AND A. SINCLAIR, Approximating the permanent, SIAM J. Comput., 18 (1989), pp. 1149-1178.
10. 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.
11. A. KALAI AND S. VEMPALA, Simulated annealing for convex optimization, Math. Oper. Res., 31 (2006), pp. 253-266.
12. P. W. KASTELEYN, The statistics of dimers on a lattice I. The number of dimer arrangements on a quadratic lattice, Physica, 27 (1961), pp. 1664-1672.
13. S. KIRKPATRICK, C. D. GELATT, JR., AND M. P. VECCHI, Optimization by simulated annealing, Science, 220 (1983), pp. 671-680.
14. 4) volume algorithm, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOGS), IEEE Computer Society, Los Alamitos, CA, 2003, pp. 650-659.
15. P. MCCULLAGH, On Prediction and Density Estimation, preprint, University of Chicago, Chicago, IL, 2004. Available online from http://www.stat.uchicago.edu/̃pmcc/reports/.
16. H. PASULA, S. J. RUSSELL, M. OSTLAND, AND Y. RITOV, Tracking many objects with many sensors, in Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), Stockholm, Sweden, 1999, pp. 1160-1171.
17. A. SINCLAIR, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combin. Probab. Comput., 1 (1992), pp. 351-370.
18. D. ŠTEFANKOVIČ, S. VEMPALA, AND E. VIGODA, Adaptive simulated annealing: A near-optimal connection between sampling and counting, in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society, Los Alamitos, CA, 2007. Preprint available from arXiv at http://arxiv.org/abs/cs.DS/ 0612058.
19. L. G. VALIANT, The complexity of computing the permanent, Theoret. Comput, Sci., 8 (1979), pp. 189-201.