On swapping and simulated tempering algorithms

Stochastic Processes and their Applications

Volumn 104, Issue 1, 2003, Pages 131-154

  Zheng, Zhongrong ^a  

^a YORK UNIVERSITY   (Canada)

Author keywords

Dirichlet forms; Eigenvalues; Markov chains; Monte Carlo algorithms; Multimodal distributions; Simulated tempering; Spectral gap; Swapping

Indexed keywords

EID: 0037358242     PISSN: 03044149     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-4149(02)00232-6     Document Type: Article

References (23)

1. Chen, M.F., 1996. Estimation of spectral gap for Markov chains. Acta Math. Sin. New Ser. 12 (4), 337-360.
2. Chen, M.F., Wang, F.Y., 1997. Estimation of spectral gap for elliptic operators. Trans. AMS 349, 1239-1267.
3. Coluzzi, B., 1995. Numerical simulations on the 4D Heisenberg spinglass. J. Phys. A: Math. Gen. 28, 747-754.
4. Diaconis, P., Saloff-Coste, L., 1996. Logarithmic Sobolev inequalities for finite Markov chains. Ann. Appl. Probab. 6, 695-750.
5. Diaconis, P., Saloff-Coste, L., 1998. What do we know about the metropolis algorithm? J. Comput. System Sci. 57, 20-36.
6. Diaconis, P., Stroock, D., 1991. Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1, 36-61.
7. Fernández, L.A., Marinari, E., Ruiz-Lorenzo, J.J., 1995. Tempering dynamics and relaxation times in the 3D ising model. J. Phys. I France 5, 1247-1254.
8. Geyer, C.J., 1991. Markov Chain Monte Carlo maximum likelihood. In: Keramidas, E.M. (Ed.), Computing Science and Statistics: Proceedings of the 23rd Symposium on the Interface, Interface Foundation, Fairfax Station, pp. 156-163.
9. Geyer, C.J., 1996. Estimation and optimization of functions. In: Gilks, W.R., Richardson, S., Spiegelhalter, D.J. (Eds.), Markov Chain Monte Carlo in Practice. Chapman & Hall, London, pp. 241-258.
10. Geyer, C.J., Thompson, E.A., 1995. Annealing Markov chain Monte Carlo with applications to ancestral inference. J. Amer. Statist. Assoc. 90, 909-920.
11. Kerler, W., Rehberg, P., 1994. Simulated-tempering approach to Spin-glass Simulations. cond-mat/9402049.
12. Madras, N., 1998. Umbrella sampling and simulated tempering. In: Whittington, S.G. (Ed.), Numerical Methods for Polymeric Systems, IMA Vol. Mathematical Applications, 102, Springer, New York, pp. 19-32.
13. Madras, N., Randall, D., 2002. Markov chain decomposition for convergence rate analysis. Ann. Appl. Probab. 12, 581-606.
14. Madras, N., Piccioni, M., 1999. Importance samplingfor families of distributions. Ann. Appl. Probab. 9, 1202-1225.
15. Madras, N., Zheng, Z., 2003. On the swapping algorithm. Random Struct. Algorithms, to appear.
16. Marinari, E., 1998. Optimized Monte Carlo methods. In: Kertész, J., Kondor, I. (Eds.), Advances in Computer Simulation. Springer, New York, pp. 50-81.
17. Marinari, E., Parisi, G., 1992. Simulated tempering: a new Monte Carlo scheme. Europhys. Lett. 19, 451-458.
18. Neal, R., 1996. Sampling from multimodal distributions using tempered transitions. Statist. Comput. 6, 353-366.
19. Orlandini, E., 1998. Monte Carlo study of polymer systems by multiple Markov Chain method. In Whittington, S.G. (Ed.), Numerical Methods for Polymeric Systems. IMA Vol. Mathematical Applications, 102, Springer, New York, pp. 33-57.
20. Rosenthal, J.S., 1995. Convergence rates for Markov Chains. SIAM Rev. 37, 387-405.
21. Sinclair, A., 1993. Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhäuser, Boston.
22. Thomas, D.C., Gauderman, W.J., 1996. Gibbs sampling methods in genetics. In: Gilks, W.R., Richardson, S., Spiegelhalter, D.J. (Eds.), Markov Chain Monte Carlo in Practice. Chapman & Hall, London, pp. 419-440.
23. N-1 models at large N. Phys. Lett. B 309, 139-144.