Related Experiment Video
Updated: Jul 10, 2026

Atomically Traceable Nanostructure Fabrication
Published on: July 17, 2015
Wang-Landau algorithm: a theoretical analysis of the saturation of the error
R E Belardinelli1, V D Pereyra
1Departamento de Física, Laboratorio de Ciencias de Superficie, Universidad Nacional de San Luis, CONICET, Chacabuco 917, 5700 San Luis, Argentina. rbelar@unsl.edu.ar
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.
Related Concept Videos
Wald-Wolfowitz Runs Test I
The test works...
Wald-Wolfowitz Runs Test II
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and 0s. In...
Linearization and Approximation
Bewley Lattice Diagram
Region of Convergence of Laplace Tarnsform
Consider a decaying exponential signal that begins at a specific time. When deriving its Laplace transform, the time-domain variable is replaced with a complex variable. This substitution...
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...