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

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 183-193

  Štefankovič, Daniel ^a   Vempala, Santosh ^b   Vigoda, Eric ^b  

^a University of Rochester   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SIMULATED ANNEALING (ASA); CARDINALITY; COOLING SCHEDULES; DISCRETE SETS; DISCRETE SYSTEMS; INVERSE TEMPERATURES; MATCHINGS; OPTIMAL REDUCTIONS; PARTITION FUNCTIONS;

ANNEALING; COMPUTER SCIENCE; FERROMAGNETISM; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; ISING MODEL; MAGNETISM; PARTITIONS (BUILDING); SEMICONDUCTOR MATERIALS; STANDARDS;

SIMULATED ANNEALING;

EID: 46749149269     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389491     Document Type: Conference Paper

References (25)

1. László Babai, Monte-Carlo algorithms in graph isomorphism testing, Université tde Montréal Technical Report, DMS 79-10, 1979 (42), see also http://people.cs.uchicago.edu/laci/lasvegas79.pdf.
2. I. Bezáková, D. Štefankovič, V. Vazirani, and E. Vigoda, Accelerating simulated annealing for combinatorial counting. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 900-907, 2006.
3. M. E. Dyer and A. Frieze. Computing the volume of a convex body: a case where randomness provably helps. In Proceedings of AMS Symposium on Probabilistic Combinatorics and Its Applications, 123-170. 1991.
4. M.E. Dyer, A.M. Frieze, and R. Kannan, A random polynomial time algorithm for approximating the volume of convex bodies. Journal of the ACM, 38(1): 1-17, 1991.
5. M. E. Dyer and C. Greenhill, On Markov Chains for Independent Sets. J. Algorithms, 35(1): 17-49, 2000.
6. A. M. Ferrenberg and R. H. Swendsen, Physical Review Letters, 61, 2635-2638, 1988.
7. A. Frieze and F. Vigoda, A survey on the use of Markov chains to randomly sample colorings. Combinatorics, Complexity and Chance, Oxford University Press, 53-71, 2007.
8. S. Janson, T. Luczak, and A. Ruciński, Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization, 2000.
9. M. Jerrum, Counting, sampling and integrating: algorithms and complexity. Lectures in Mathematics, Birkhäuser Verlag, 2003.
10. M. Jerrum, A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Structures and Algorithms, 7(2): 157-165, 1995.
11. M. Jerrum and A. Sinclair, Approximating the permanent. SIAM Journal on Computing, 18:1149-1178, 1989.
12. M. Jerrum, A. Sinclair, and E. Vigoda, A polynomialtime approximation algorithm for the permanent of a matrix with non-negative entries. Journal of the ACM, 51(4):671-697, 2004.
13. M. Jerrum, L. Valiant, and V. Vazirani, Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43(2-3): 169-188, 1986.
14. A. Kalai and S. Vempala, Simulated Annealing for Convex Optimization. Mathematics of Operations Research, 31(2), 2006, 253-266.
15. 5) volume algorithm for convex bodies. Random Structures and Algorithms 11, 1-50, 1997.
16. 4) volume algorithm. Journal of Computer and System Sciences, 72(2):292-417, 2006.
17. L. Lovász and S. Vempala, Fast algorithms for logconcave functions: sampling, rounding, integration and optimization. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 57-68, 2006.
18. F. Martinelli, Relaxation times of Markov chains in statistical mechanics and combinatorial structures, Encyclopedia of Mathematical Sciences, Vol. 110, Springer, 2003.
19. F. Martinelli and E. Olivieri, Approach to equilibrium of Glauber dynamics in the one phase region I: The attractive case. Communications in Mathematical Physics, 161:447-486, 1994.
20. Z. W. Salsburg, J.D. Jacobson, W. Fickett, and W. W. Wood, Application of the Monter Carlo method to the lattice-gas model, The Journal of Chemical Physics, 30(1):65-72, 1959.
21. D. Štefankovič, S. Vempala, and E. Vigoda, Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. Available from arXiv at: http://arxiv.org/abs/cs.DS/0612058
22. J. P. Valleau and D. N. Card, Monte Carlo Estimation of the Free Energy by Multistage Sampling, The Journal of Chemical Physics, 57( 12):5457-5462, 1972.
23. E. Vigoda, A note on the Glauber dynamics for sampling independent sets. Electronic Journal of Combinatorics, 8(1), 2001.
24. D. Weitz, Mixing in time and space for discrete spin systems, Ph.D. thesis, U.C. Berkeley, May 2004. Available from http://dimacs.rutgers.edu/~dror/ thesis/thesis.pdf
25. D. Weitz, Counting independent sets up to the tree threshold. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), 140-149, 2006.