Wang-Landau Algorithm: a Theoretical Analysis of the Saturation of the Error
arXiv:cond-mat/0702414 · doi:10.1063/1.2803061
Abstract
In this work we present a theoretical analysis of the convergence of the Wang-Landau algorithm [Phys. Rev. Lett. 86, 2050 (2001)] which was introduced years ago to calculate the density of states in statistical models. We study the dynamical behavior of the error in the calculation of the density of states.We conclude that the source of the saturation of the error is due to the decreasing variations of the refinement parameter. To overcome this limitation, we present an analytical treatment in which the refinement parameter is scaled down as a power law instead of exponentially. An extension of the analysis to the N-fold way variation of the method is also discussed.
7 pages, 5 figures
References in corpus (2)
Cited by in corpus (28)
- Enhanced sampling methods for molecular dynamics simulations
- Accelerated weight histogram method for exploring free energy landscapes
- Optimal Modification Factor and Convergence of the Wang-Landau Algorithm
- Analysis of the convergence of the 1/t and Wang-Landau algorithms in the calculation of multidimensional integrals
- Structure-based prediction of protein-folding transition paths
- Quenched bond randomness in marginal and non-marginal Ising spin models in 2D
- Classical many-particle systems with unique disordered ground states
- Universality aspects of the 2d random-bond Ising and 3d Blume-Capel models
- Control of accuracy in the Wang-Landau algorithm
- Parallel PERM
- Convex Hulls of Random Walks in Higher Dimensions: A Large Deviation Study
- Fourier Monte Carlo Renormalization Group Approach to Crystalline Membranes
- Multicanonical Sampling of the Space of States of H(2,n)-Vector Models
- Reweight-annealing method for evaluating the partition function via quantum Monte Carlo calculations
- Computer simulation of two continuous spin models using Wang-Landau-Transition-Matrix Monte Carlo Algorithm
- The Random-Bond Ising Model and its dual in Hyperbolic Spaces
- Intrinsic convergence properties of entropic sampling algorithms
- Convergence of Stochastic Approximation Monte Carlo and modified Wang-Landau algorithms: Tests for the Ising model
- Entropy of unimodular Lattice Triangulations
- Perturbation method to calculate the density of states
- Multiple Topology Replica Exchange of Expanded Ensembles (MT-REXEE) for Multidimensional Alchemical Calculations
- Wang-Landau simulations with non-flat distributions
- Real Time Simulations of Quantum Spin Chains: Density-of-States and Reweighting approaches
- Exploring the free energy gain of phase separation via Markov State Modeling
- Large deviations of connected components in the stochastic block model
- Rejection-free cluster Wang-Landau algorithm for hard-core lattice gases
- Configuration space partitioning in tilings of a bounded region of the plane
- The Accuracy and Performance Analysis of the 1/t Wang-Landau Algorithm in the Joint Density of States Estimation