On the Swapping Algorithm

Random Structures and Algorithms

Volumn 22, Issue 1, 2003, Pages 66-97

  Madras, Neal ^a   Zheng, Zhongrong ^a  

^a YORK UNIVERSITY   (Canada)

Author keywords

Decomposition; Markov chain Monte Carlo; Meanfield Ising model; Metropolis coupled Markov chains; Spectral gap

Indexed keywords

EID: 0037236515     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10066     Document Type: Article

References (30)

1. K. Binder and D. W. Heermann, Monte Carlo simulation in statistical physics, Springer-Verlag, Berlin, 1992.
2. S. Caracciolo, A. Pelissetto, and A. D. Sokal, Two remarks on simulated tempering, unpublished manuscript, 1992.
3. M.-F. Chen, Estimation of spectral gap for Markov chains, Acta Math Sin New Ser 12(4) (1996), 337-360.
4. M.-F. Chen and F.-Y. Wang, Estimation of spectral gap for elliptic operators, Trans AMS 349 (1997), 1239-1267.
5. C. Cooper, M. E. Dyer, A. M. Frieze, and R. Rue, Mixing properties of the Swendsen-Wang process on the complete graph and narrow grids, J Math Phys 41 (2000), 1499-1527.
6. P. Diaconis and L. Saloff-Coste, Comparison theorems for reversible Markov chains, Ann Appl Probab 3 (1993), 696-730.
7. P. Diaconis and L. Saloff-Coste, Logarithmic Sobolev inequalities for finite Markov chains, Ann Appl Probab 6 (1996), 695-750.
8. P. Diaconis and L. Saloff-Coste, What do we know about the Metropolis algorithm? J Comput Syst Sci 57 (1998), 20-36.
9. P. Diaconis and D. Stroock, Geometric bounds for eigenvalues of Markov chains, Ann Appl Probab 1 (1991), 36-61.
10. R. Durrett, Probability, theory and examples, 2nd edition, Wadsworth, Belmont, CA, 1996.
11. W. Feller, An introduction to probability theory and its applications, Vol. I, 3rd edition, Wiley, Toronto, 1968.
12. D. Frenkel and B. Smit, Understanding molecular simulation, Academic Press, San Diego, 1996.
13. C. J. Geyer, "Markov chain Monte Carlo maximum likelihood," Computing science and statistics: Proceedings of the 23rd Symposium on the Interface, Ed. E. M. Keramidas, 156-163. Interface Foundation, Fairfax Station, VA, 1991.
14. C. J. Geyer and E. A. Thompson, Annealing Markov chain Monte Carlo with applications to ancestral inference, J Am Stat Assoc 90 (1995), 909-920.
15. W. R. Gilks, S. Richardson, and D. J. Spiegelhalter, Eds., Markov chain Monte Carlo in practice, Chapman and Hall, London, 1996.
16. V. K. Gore and M. R. Jerrum, The Swensen-Wang process does not always mix rapidly, J Stat Phys 97 (1999), 67-86.
17. M. Luby, D. Randall, and A. Sinclair, Markov chain algorithms for planar lattice structures, Proc 36th Annu IEEE Symp Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 150-159.
18. N. Madras, "Umbrella sampling and simulated tempering," Numerical methods for polymeric systems, Ed. S. G. Whittington, IMA Volume in Mathematics and Its Applications 102, 19-32. Springer-Verlag, New York, 1998.
19. N. Madras and M. Piccioni, Importance sampling for families of distributions, Ann Appl Probab 9 (1999), 1202-1225.
20. N. Madras and D. Randall, Markov chain decomposition for convergence rate analysis, Ann Appl Probab 12 (2002), 581-606.
21. E. Marinari and G. Parisi, Simulated tempering: A new Monte Carlo scheme, Europhys Lett 19 (1992), 451-458.
22. R. A. Martin and D. Randall, Sampling adsorbing staircase walks using a new Markov chain decomposition method, Proc 41st Annu IEEE Symp Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 2000, pp. 492-502.
23. R. Neal, Sampling from multimodal distributions using tempered transitions, Stat Comput 6 (1996), 353-366.
24. E. Orlandini, "Monte Carlo study of polymer systems by multiple Markov chain method," Numerical methods for polymeric systems, Ed., S. G. Whittington, IMA Volume in Mathematics and Its Applications 102, 33-57. Springer-Verlag, New York, 1998.
25. J. Quastel, Diffusion of colour in the simple exclusion process, Commun Pure Appl Math 42 (1992), 115-137.
26. J. S. Rosenthal, Convergence rates for Markov chains, SIAM Rev 37 (1995), 387-405.
27. A. Sinclair, Algorithms for random generation and counting: A Markov chain approach, Birkhäuser, Boston, 1993.
28. R. H. Swendsen and J.-S. Wang, Nonuniversal critical dynamics in Monte Carlo simulations, Phys Rev Lett 58 (1987), 86-88.
29. Z. Zheng, Analysis of swapping and tempering Monte Carlo algorithms, Dissertation, York University, 1999.
30. Z. Zheng, On swapping and simulated tempering algorithms, Stoch Proc Appl (2002), to appear.