Optimal Modification Factor and Convergence of the Wang-Landau Algorithm

Abstract

We propose a strategy to achieve the fastest convergence in the Wang-Landau algorithm with varying modification factors. With this strategy, the convergence of a simulation is at least as good as the conventional Monte Carlo algorithm, i.e. the statistical error vanishes as $1/\sqrt{t}$, where $t$ is a normalized time of the simulation. However, we also prove that the error cannot vanish faster than $1/t$. Our findings are consistent with the $1/t$ Wang-Landau algorithm discovered recently, and we argue that one needs external information in the simulation to beat the conventional Monte Carlo algorithm.

19 pages and 3 figures, to be published in Phys. Rev. E

References in corpus (21)

• An efficient, multiple range random walk algorithm to calculate the density of states
• Multicanonical Ensemble: A New Approach to Simulate First-order Phase Transitions
• Determining the density of states for classical statistical models: A random walk algorithm to produce a flat histogram
• Equilibrium free energies from non-equilibrium metadynamics
• Fast Algorithm to Calculate Density of States
• On the Wang-Landau Method for Off-Lattice Simulations in the "Uniform" Ensemble
• Understanding and Improving the Wang-Landau Algorithm
• Optimizing the ensemble for equilibration in broad-histogram Monte Carlo simulations
• Density of States Monte Carlo Method for Simulation of Fluids
• Wang-Landau algorithm for continuous models and joint density of states
• Wang-Landau Algorithm: a Theoretical Analysis of the Saturation of the Error
• Avoiding Boundary Effects in Wang-Landau Sampling
• Performance Limitations of Flat Histogram Methods and Optimality of Wang-Landau Sampling
• Transitions of tethered polymer chains: A simulation study with the bond fluctuation lattice model
• Convergence and Refinement of the Wang-Landau Algorithm
• Three-dimensional antiferromagnetic q-state Potts models: application of the Wang-Landau algorithm
• Flat Histogram Method of Wang-Landau and N-fold Way
• Wang-Landau Monte Carlo simulation of isotropic-nematic transition in liquid crystals
• Simulation via Direct Computation of Partition Functions
• Combination of improved multibondic method and the Wang-Landau method
• Sampling the two-dimensional density of states g(E,M) of a giant magnetic molecule using the Wang-Landau method

Cited by in corpus (32)

• Accelerated weight histogram method for exploring free energy landscapes
• Analysis of the convergence of the 1/t and Wang-Landau algorithms in the calculation of multidimensional integrals
• Optimized Wang-Landau sampling of lattice polymers: Ground state search and folding thermodynamics of HP model proteins
• Improving the efficiency of extended ensemble simulations: The accelerated weight histogram method
• Wang-Landau sampling: Improving accuracy
• Multicanonical MCMC for Sampling Rare Events
• Wang-Landau sampling: a criterion for halting the simulations
• Difference of energy density of states in the Wang-Landau algorithm
• First-order transitions and thermodynamic properties in the 2D Blume-Capel model: the transfer-matrix method revisited
• Control of accuracy in the Wang-Landau algorithm
• Phase transition of a single star polymer: a Wang-Landau sampling study
• On the non-convergence of the Wang-Landau algorithms with multiple random walkers
• Parallel PERM
• Intrinsic convergence properties of entropic sampling algorithms
• Critical behavior of hard-core lattice gases: Wang-Landau sampling with adaptive windows
• Convergence of Stochastic Approximation Monte Carlo and modified Wang-Landau algorithms: Tests for the Ising model
• The Wang-Landau Algorithm as Stochastic Optimization and Its Acceleration
• Dynamic Canonical and Microcanonical Transition Matrix Analyses of Critical Behavior
• Perturbation method to calculate the density of states
• Dynamically Optimized Wang-Landau Sampling with Adaptive Trial Moves and Modification Factors
• A Projected Entropy Controller for Transition Matrix Calculations
• Flat histogram method comparison on 2D Ising Model
• A Cluster Controller for Transition Matrix Calculations
• Accuracy and Efficiency of Simplified Tensor Network Codes
• Connecting the Unstable Region of the Entropy to the Pattern of the Fisher's Zeros Map
• Numerical estimates of square lattice star vertex exponents
• Predicting Polymer Brush Behavior in Solvents using the Steepest-Entropy-Ascent Quantum Thermodynamic Framework
• On the mixing time in the Wang-Landau algorithm
• Stochastic Approximation Monte Carlo with a Dynamic Update Factor
• Performance of Wang-Landau algorithm in lattice model of liquid crystals
• Transition Matrix Cluster Algorithms
• On the nature of the phase transitions in two-dimensional type II superconductors