Accuracy and convergence of the Wang-Landau sampling algorithm

Alexander N. Morozov and Sheng Hsien Lin
Phys. Rev. E 76, 026701 – Published 1 August 2007

Abstract

We present estimations of the accuracy and convergence of the Wang-Landau algorithm. Both accuracy and the related length of the Monte Carlo run depend on the modification parameter f and the density of states. The analytical solution obtained for the two-level system was checked numerically on the two-dimensional Ising model. Although the two-level system is a very simple one, it appears that the proposed solution describes the generic features of the Wang-Landau algorithm. The estimations should prove useful in Monte Carlo calculations of protein folding, first-order transitions, and other systems with a rough energy landscape.

  • Figure
  • Figure
  • Figure
  • Figure
  • Received 5 March 2007

DOI:https://doi.org/10.1103/PhysRevE.76.026701

©2007 American Physical Society

Authors & Affiliations

Alexander N. Morozov and Sheng Hsien Lin

  • Institute of Atomic and Molecular Sciences, Academia Sinica, P.O. Box 23-166, Taipei, Taiwan, Republic of China

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 76, Iss. 2 — August 2007

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×