Adaptive simulated annealing: A near-optimal connection between sampling and counting

Journal of the ACM

Volumn 56, Issue 3, 2009, Pages

  Stefankovic, Daniel ^a   Vempala, Santosh ^b   Vigoda, Eric ^b  

^a UNIVERSITY OF ROCHESTER   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Counting; Markov chain Monte Carlo; Simulated annealing

Indexed keywords

ADAPTIVE SIMULATED ANNEALING; APPROXIMATE COUNTING; CARDINALITIES; CONVEX BODY; COOLING SCHEDULE; COUNTING; DISCRETE SETS; DISCRETE SYSTEMS; INVERSE TEMPERATURES; MARKOV CHAIN MONTE CARLO; MATCHINGS; OPTIMAL REDUCTIONS; PARTITION FUNCTIONS; RUNNING TIME;

ADAPTIVE ALGORITHMS; ANNEALING; COLORING; COOLING; ESTIMATION; ISING MODEL; MARKOV PROCESSES; MONTE CARLO METHODS; SET THEORY; UNCERTAIN SYSTEMS;

SIMULATED ANNEALING;

EID: 69149093392     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1516512.1516520     Document Type: Article

References (25)

1. Babai, L. 1979. Monte-carlo algorithms in graph isomorphism testing. Tech. Rep. 79-10, Universite de Montreal, Montreal, Quebec.
2. Bezkov, I., Štefankovi, D., Vazirani, V. V., and Vigoda, E. 2008. Accelerating simulated annealing for the permanent and combinatorial counting problems. SIAM J. Comput. 37, 5, 1429-1454.
3. Dyer, M., and Frieze, A. 1991. Computing the volume of convex bodies: a case where randomness provably helps. In Probabilistic combinatorics and its applications. Proceedings of Symposiusm on Applied Mathematics, vol. 44. American Mathematics Society, Providence, RI, 123-169.
4. Dyer, M., Frieze, A., and Kannan, R. 1991. A random polynomial-time algorithm for approximating the volume of convex bodies. J. ACM 38, 1, 1-17.
5. Ferrenberg, A. M., and Swendsen, R. H. 1988. New Monte Carlo technique for studying phase transitions. Phys. Rev. Lett. 61, 23 (December), 2635+.
6. Frieze, A., and Vigoda, E. 2007. A survey on the use of Markov chains to randomly sample colourings. In Combinatorics, complexity, and chance. Oxford Lecture Ser. Math. Appl., vol. 34. Oxford Univ. Press, Oxford, UK, 53-71.
7. Gillman, D. 1998. A Chernoff bound for random walks on expander graphs. SIAM J. Comput. 27, 4, 1203-1220 (electronic).
8. Janson, S., Luczak, T., and Rucinski, A. 2000. Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York.
9. Jerrum, M. 1995. A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Struct. Algor. 7, 2, 157-165.
10. Jerrum, M. 2003. Counting, sampling and integrating: algorithms and complexity. Lectures in Mathematics ETH Zurich. Birkhauser Verlag, Basel.
11. Jerrum, M., and Sinclair, A. 1989. Approximating the permanent. SIAM J. Comput. 18, 6, 1149-1178.
12. Jerrum, M., Sinclair, A., and Vigoda, E. 2004. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51, 4, 671-697 (electronic).
13. Jerrum, M. R., Valiant, L. G., and Vazirani, V. V. 1986. Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci. 43, 2-3, 169-188.
14. 5) volume algorithm for convex bodies. Random Struct. Algor. 11, 1, 1-50.
15. Lovsz, L., and Vempala, S. 2006a. Fast algorithms for logconcave functions: Sampling, rounding, integration and optimization. In Proceedings of the Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA, 57-68.
16. 4) volume algorithm. J. Comput. Syst. Sci. 72, 2, 392-417.
17. Martinelli, F. 2004. Relaxation times of Markov chains in statistical mechanics and combinatorial structures. In Probability on Discrete Structures. Encyclopaedia Math. Sci., vol. 110. Springer-Verlag, Berlin, Germany, 175-262.
18. Martinelli, F., and Olivieri, E. 1994. Approach to equilibrium of Glauber dynamics in the one phase region. I. The attractive case. Comm. Math. Phys. 161, 3, 447-486.
19. Salsburg, Z. W., Jacobson, J. D., Fickett, W., and Wood, W. W. 1959. Application of
20. the Monte Carlo method to the lattice-gas model. J. Chem. Phys. 30, 1, 65-72.
21. Valleau, J. P., and Card, D. N. 1972. Monte Carlo estimation of the free energy by multistage sampling. J. Chem. Phys. 57, 12, 5457-5462.
22. Vempala, S. 2005. Geometric random walks: A survey. In Combinatorial and computational geometry. Math. Sci. Res. Inst. Publ., vol. 52. Cambridge Univ. Press, Cambridge, MA, 577-616.
23. Vigoda, E. 2001. A note on the Glauber dynamics for sampling independent sets. Electron. J. Combin. 8, 1, Research Paper 8, 8 pp. (electronic).
24. Weitz, D. 2004. Mixing in time and space for discrete spin systems. Ph.D. dissertation, University of California, Berkeley, CA.
25. Weitz, D. 2006. Counting independent sets up to the tree threshold. In STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM, New York, 140-149.