A generalized Wang-Landau algorithm for Monte Carlo computation

Journal of the American Statistical Association

Volumn 100, Issue 472, 2005, Pages 1311-1327

  Liang, Faming ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

1 k ensemble sampling; Importance sampling; Markov chain Monte Carlo; Monte Carlo integration; Monte Carlo optimization; Multicanoni al algorithm; Wang Landau algorithm

Indexed keywords

EID: 29144446035     PISSN: 01621459     EISSN: None     Source Type: Journal    
DOI: 10.1198/016214505000000259     Document Type: Article

References (31)

1. Berg, B. A., and Neuhaus, T. (1991), "Multicanonical Algorithms for 1st Order Phase-Transitions," Physics Letters B, 267, 249-253.
2. Bishop, C. M. (1995), Neural Networks for Pattern Recognition, Oxford, U.K. : Oxford University Press.
3. Chen, M. H., and Shao, Q. M. (1999), "Monte Carlo Estimation of Bayesian Credible and HPD Intervals," Journal of Computational and Graphical Statistics, 8, 69-92.
4. Chen, M. H., Shao, Q. M., and Ibrahim, J. G. (2000), Monte Carlo Methods in Bayesian Computation, New York: Springer-Verlag.
5. Gelman, A., Roberts, R. O., and Gilks, W. R. (1996), "Efficient Metropolis Jumping Rules," in Bayesian Statistics 5, eds. J. M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith, New York: Oxford University Press, pp. 599-608.
6. Geman, S., and Geman, D. (1984), "Stochastic Relaxation, Gibbs Distributions and the Bayesian Restoration of Images," IEEE Transactions on Pattern Analysis and Machine Intelligence, 6, 721-741.
7. Geyer, C. J. (1991), "Markov Chain Monte Carlo Maximum Likelihood," in Computing Science and Statistics: Proceedings of the 23rd Symposium on the Interface, ed. E. M. Keramigas, Fairfax Station, VA: Interface Foundation, pp. 156-163.
8. Geyer, C. J., and Thompson, E. A. (1995), "Annealing Markov Chain Monte Carlo With Applications to Ancestral Inference," Journal of the American Statistical Association, 90, 909-920.
9. Hansmann, U. H. E., and Okamoto, Y. (1997), "Numerical Comparisons of Three Recently Proposed Algorithms in the Protein Folding Problems," Journal of Computational Chemistry, 18, 920-933.
10. Hastings, W. K. (1970), "Monte Carlo Sampling Methods Using Markov Chains and Their Applications," Biometrika, 57, 97-109.
11. Hesselbo, B., and Stinchcombe, R. B. (1995), "Monte Carlo Simulation and Global Optimization Without Parameters," Physical Review Letters, 74, 2151-2155.
12. Hyndman, R. J. (1996), "Computing and Graphing Highest Density Regions," The American Statistician, 50, 120-126.
13. Kass, R. E., and Wasserman, L. (1996), "The Selection of Prior Distributions by Formal Rules," Journal of the American Statistical Association, 91, 1343-1370.
14. Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P. (1983), "Optimization by Simulated Annealing," Science, 220, 671-680.
15. Lang, K. J., and Witbrock, M. J. (1988), "Learning to Tell Two Spirals Apart," in Proceedings of the 1988 Connectionist Models, eds. D. Touretzky, G. Hinton, and T. Sejnowski, San Mateo, CA: Morgan Kaufmann, pp. 52-59.
16. Lee, J., and Cho, M. Y. (1994), "Optimization by Multicanonical Annealing and the Traveling Salesman Problem," Physical Review E, 50, 651-654.
17. Liang, F. (2002), "Dynamically Weighted Importance Sampling in Monte Carlo Computation," Journal of the American Statistical Association, 97, 807-821.
18. Liang, F., and Wong, W. H. (2001), "Real Parameter Evolutionary Monte Carlo With Applications in Bayesian Mixture Models," Journal of the American Statistical Association, 96, 653-666.
19. Marinari, E., and Parisi, G. (1992), "Simulated Tempering: A New Monte Carlo Scheme," Europhysics Letters, 19, 451-458.
20. Meng, X. L., and Wong, W. H. (1996), "Simulating Ratios of Normalizing Constants via a Simple Identity: A Theoretical Exploration," Statistica Sinica, 6, 831-860.
21. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., and Teller, E. (1953), "Equation of State Calculations by Fast Computing Machines," Journal of Chemical Physics, 21, 1087-1091.
22. Rathore, N., and de Pablo, J. J. (2002), "Monte Carlo Simulation of Proteins Through a Random Walk in Energy Space," Journal of Chemical Physics, 116, 7225-7230.
23. Robert, C. P., and Casella, G. (1999), Monte Carlo Statistical Methods, New York: Springer-Verlag.
24. Roberts, G. O. (1996), "Markov Chain Concepts Related to Sampling Algorithms," in Markov Chain Monte Carlo in Practice, eds. W. R. Gilks, S. Richardson, and D. J. Spiegelhalter, London: Chapman & Hall, pp. 45-58.
25. Rumelhart, D., and McClelland, J. (1986), Parallel Distributed Processing, Cambridge, MA: MIT Press.
26. Swendsen, R. H., and Wang, J. S. (1987), "Nonuniversal Critical Dynamics in Monte Carlo Simulations," Physical Review Letters, 58, 86-88.
27. Tanner, M. A. (1996), Tools for Statistical Inference (3rd ed.), New York: Springer-Verlag.
28. Tierney, L. (1994), "Markov Chains for Exploring Posterior Distributions" (with discussion), The Annals of Statistics, 22, 1701-1786.
29. Wang, F., and Landau, D. P. (2001), "Efficient, Multiple-Range Random Walk Algorithm to Calculate the Density of States," Physical Review Letters, 86, 2050-2053.
30. Wei, G. C. G., and Tanner, M. A. (1990), "Calculating the Content and Boundary of the Highest Posterior Density Region via Data Augmentation," Biometrika, 77, 649-652.
31. Yamaguchi, C., and Okabe, Y. (2001), "Three-Dimensional Antiferromagnetic q-State Potts Models: Application of the Wang-Landau Algorithm," Journal of Physics A, 34, 8781-8794.