Understanding and improving the Wang-Landau algorithm

Chenggang Zhou; R. N. Bhatt

doi:10.1103/PhysRevE.72.025701

Understanding and improving the Wang-Landau algorithm

Chenggang Zhou, R. N. Bhatt

Research output: Contribution to journal › Article › peer-review

169 Scopus citations

Abstract

We present a mathematical analysis of the Wang-Landau algorithm, prove its convergence, and identify sources of errors and strategies for optimization. In particular, we found the histogram increases uniformly with small fluctuations after a stage of initial accumulation, and the statistical error is found to scale as lnf with the modification factor f. This has implications for strategies for obtaining fast convergence.

Original language	English (US)
Article number	025701
Journal	Physical Review E - Statistical, Nonlinear, and Soft Matter Physics
Volume	72
Issue number	2
DOIs	https://doi.org/10.1103/PhysRevE.72.025701
State	Published - Aug 2005

All Science Journal Classification (ASJC) codes

Condensed Matter Physics
Statistical and Nonlinear Physics
Statistics and Probability

Access to Document

10.1103/PhysRevE.72.025701

Cite this

@article{5996ba9095354a02989939a04f5b2d4f,

title = "Understanding and improving the Wang-Landau algorithm",

abstract = "We present a mathematical analysis of the Wang-Landau algorithm, prove its convergence, and identify sources of errors and strategies for optimization. In particular, we found the histogram increases uniformly with small fluctuations after a stage of initial accumulation, and the statistical error is found to scale as lnf with the modification factor f. This has implications for strategies for obtaining fast convergence.",

author = "Chenggang Zhou and Bhatt, {R. N.}",

year = "2005",

month = aug,

doi = "10.1103/PhysRevE.72.025701",

language = "English (US)",

volume = "72",

journal = "Physical Review E - Statistical, Nonlinear, and Soft Matter Physics",

issn = "1539-3755",

publisher = "American Physical Society",

number = "2",

}

TY - JOUR

T1 - Understanding and improving the Wang-Landau algorithm

AU - Zhou, Chenggang

AU - Bhatt, R. N.

PY - 2005/8

Y1 - 2005/8

N2 - We present a mathematical analysis of the Wang-Landau algorithm, prove its convergence, and identify sources of errors and strategies for optimization. In particular, we found the histogram increases uniformly with small fluctuations after a stage of initial accumulation, and the statistical error is found to scale as lnf with the modification factor f. This has implications for strategies for obtaining fast convergence.

AB - We present a mathematical analysis of the Wang-Landau algorithm, prove its convergence, and identify sources of errors and strategies for optimization. In particular, we found the histogram increases uniformly with small fluctuations after a stage of initial accumulation, and the statistical error is found to scale as lnf with the modification factor f. This has implications for strategies for obtaining fast convergence.

UR - http://www.scopus.com/inward/record.url?scp=27244439515&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27244439515&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.72.025701

DO - 10.1103/PhysRevE.72.025701

M3 - Article

C2 - 16196637

AN - SCOPUS:27244439515

SN - 1539-3755

VL - 72

JO - Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

JF - Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

IS - 2

M1 - 025701

ER -

Understanding and improving the Wang-Landau algorithm

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this