Convergence and Refinement of the Wang-Landau Algorithm

Details Convergence and Refinement of the Wang-Landau Algorithm Convergence and Refinement of the Wang-Landau Algorithm

2005-06-22

arxiv.org/abs/cond-mat/0506555v1

Comp. Phys. Commun. 175, 36 (2006)

Physics

Condensed Matter

Statistical Mechanics

6 pages, submitted to Comp. Phys. Comm

Scientific paper

10.1016/j.cpc.2006.02.009

Recently, Wang and Landau proposed a new random walk algorithm that can be very efficiently applied to many problems. Subsequently, there has been numerous studies on the algorithm itself and many proposals for improvements were put forward. However, fundamental questions such as what determines the rate of convergence has not been answered. To understand the mechanism behind the Wang-Landau method, we did an error analysis and found that a steady state is reached where the fluctuations in the accumulated energy histogram saturate at values proportional to $[\log(f)]^{-1/2}$. This value is closely related to the error corrections to the Wang-Landau method. We also study the rate of convergence using different "tuning" parameters in the algorithm.

Affiliated with

Also associated with

No associations

Rating

Convergence and Refinement of the Wang-Landau Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Convergence and Refinement of the Wang-Landau Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergence and Refinement of the Wang-Landau Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-480237