A Generalized Wang–Landau Algorithm for Monte Carlo Computation
- 1 December 2005
- journal article
- Published by Taylor & Francis in Journal of the American Statistical Association
- Vol. 100 (472) , 1311-1327
- https://doi.org/10.1198/016214505000000259
Abstract
Inference for a complex system with a rough energy landscape is a central topic in Monte Carlo computation. Motivated by the successes of the Wang–Landau algorithm in discrete systems, we generaliz...Keywords
This publication has 21 references indexed in Scilit:
- Dynamically Weighted Importance Sampling in Monte Carlo ComputationJournal of the American Statistical Association, 2002
- Three-dimensional antiferromagneticq-state Potts models: application of the Wang-Landau algorithmJournal of Physics A: General Physics, 2001
- Efficient, Multiple-Range Random Walk Algorithm to Calculate the Density of StatesPhysical Review Letters, 2001
- Monte Carlo Estimation of Bayesian Credible and HPD IntervalsJournal of Computational and Graphical Statistics, 1999
- The Selection of Prior Distributions by Formal RulesJournal of the American Statistical Association, 1996
- Computing and Graphing Highest Density RegionsThe American Statistician, 1996
- Annealing Markov Chain Monte Carlo with Applications to Ancestral InferenceJournal of the American Statistical Association, 1995
- Markov Chains for Exploring Posterior DistributionsThe Annals of Statistics, 1994
- Optimization by multicanonical annealing and the traveling salesman problemPhysical Review E, 1994
- Optimization by Simulated AnnealingScience, 1983