A Generalized Wang–Landau Algorithm for Monte Carlo Computation
From MaRDI portal
Publication:5754897
DOI10.1198/016214505000000259zbMATH Open1117.62384OpenAlexW1981576072MaRDI QIDQ5754897FDOQ5754897
Authors: Faming Liang 
Publication date: 20 August 2007
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1198/016214505000000259
Recommendations
- Stochastic Approximation in Monte Carlo Computation
- The Wang-Landau algorithm in general state spaces: applications and convergence analysis
- Wang-Landau algorithm: an adapted random walk to boost convergence
- Convergence of the Wang-Landau algorithm
- Efficiency of the Wang-Landau algorithm: a simple test case
Cited In (28)
- ``Worm algorithm in quantum Monte Carlo simulations
- Free energy computations by minimization of Kullback-Leibler divergence: An efficient adaptive biasing potential method for sparse representations
- The simulation of spin glass model of neural networks by the Wang-Landau algorithm
- Numerical integration using Wang-Landau sampling
- Sampling from rough energy landscapes
- Monte Carlo Approximation of Bayes Factors via Mixing With Surrogate Distributions
- THE STUDY OF QUENCHED BOND RANDOMNESS BY WANG–LANDAU ALGORITHM
- An overview of stochastic approximation Monte Carlo
- Annealing stochastic approximation Monte Carlo algorithm for neural network training
- Building a telescope to look into high-dimensional image spaces
- Trajectory averaging for stochastic approximation MCMC algorithms
- A generalized hard-sphere model for Monte Carlo simulation
- Convergence of the Wang-Landau algorithm
- The Wang-Landau algorithm in general state spaces: applications and convergence analysis
- Multicanonical MCMC for sampling rare events: an illustrative review
- Improving SAMC using smoothing methods: Theory and applications to Bayesian model selection problems
- Unraveling the beautiful complexity of simple lattice model polymers and proteins using Wang-Landau sampling
- Reconstructing the energy landscape of a distribution from Monte Carlo samples
- Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities
- Stochastic Approximation in Monte Carlo Computation
- Warp Bridge Sampling: The Next Generation
- A portable and flexible implementation of the Wang-Landau algorithm in order to determine the density of states
- An adaptively weighted stochastic gradient MCMC algorithm for Monte Carlo simulation and global optimization
- Foam: A general purpose Monte Carlo cellular algorithm
- Convergence of stochastic approximation Monte Carlo and modified Wang-Landau algorithms: tests for the Ising model
- A \(1/t\) algorithm with the density of two states for estimating multidimensional integrals
- Free energy methods for Bayesian inference: efficient exploration of univariate Gaussian mixture posteriors
- The Wang-Landau algorithm reaches the flat histogram criterion in finite time
This page was built for publication: A Generalized Wang–Landau Algorithm for Monte Carlo Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5754897)
