Publication: The Wang-Landau algorithm in general state spaces: applications and convergence analysis
Open/View Files
Date
2010
Authors
Published Version
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Statistical Science, Academia Sinica
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Atchadé, Yves F., and Jun S. Liu. 2010. "The Wang-Landau algorithm in general state spaces: applications and convergence analysis." Statistica Sinica 20 (1): 209-233.
Research Data
Abstract
The Wang-Landau algorithm (Wang and Landau (2001)) is a recent Monte Carlo method that has generated much interest in the Physics literature due to some spectacular simulation performances. The objective of this paper is two-fold. First, we show that the algorithm can be naturally extended to more general state spaces and used to improve on Markov Chain Monte Carlo schemes of more interest in Statistics. In a second part, we study asymptotic behaviors of the algorithm. We show that with an appropriate choice of the step-size, the algorithm is consistent and a strong law of large numbers holds under some fairly mild conditions. We have also shown by simulations the potential advantage of the WL algorithm for problems in Bayesian inference.
Description
Other Available Sources
Keywords
Adaptive MCMC, geometric ergodicity, Monte Carlo methods, multicanonical sampling, stochastic approximation, trans-dimensional MCMC, Wang-Landau algorithm
Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service