Wang-Landau Algorithm: a Theoretical Analysis of the Saturation of the
Error
release_rev_6cb82755-587b-4bbd-9130-0f4993e81652
by
R. E. Belardinelli,
V. D. Pereyra
2007
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.
In text/plain
format
cond-mat/0702414v2
access all versions, variants, and formats of this works (eg, pre-prints)
This is a specific, static metadata record, not necessarily linked to any current entity in the catalog.