Efficiency of the Wang-Landau Algorithm: A Simple Test Case - Archive ouverte HAL Access content directly
Journal Articles Applied Mathematics Research eXpress Year : 2014

Efficiency of the Wang-Landau Algorithm: A Simple Test Case

(1, 2) , (3, 4) , (5) , (4, 6) , (4, 6)
1
2
3
4
5
6

Abstract

We analyze the convergence properties of the Wang-Landau algorithm. This sampling method belongs to the general class of adaptive importance sampling strategies which use the free energy along a chosen reaction coordinate as a bias. Such algorithms are very helpful to enhance the sampling properties of Markov Chain Monte Carlo algorithms, when the dynamics is metastable. We prove the convergence of the Wang-Landau algorithm and an associated central limit theorem.

Dates and versions

hal-00721886 , version 1 (31-07-2012)

Identifiers

Cite

Gersende Fort, Benjamin Jourdain, Estelle Kuhn, Tony Lelièvre, Gabriel Stoltz. Efficiency of the Wang-Landau Algorithm: A Simple Test Case. Applied Mathematics Research eXpress, 2014, 2014 (2), pp.275-311. ⟨10.1093/amrx/abu003⟩. ⟨hal-00721886⟩
365 View
1 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More