Skip to Main content Skip to Navigation

Wang-Landau Algorithm: an adapted random walk to boost convergence

Augustin Chevallier 1 Frédéric Cazals 1
1 ABS - Algorithms, Biology, Structure
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : The Wang-Landau (WL) algorithm is a recently developed stochastic algorithm computing densities of states of a physical system. Since its inception, it has been used on a variety of (bio-)physical systems, and in selected cases, its convergence has been proved. The convergence speed of the algorithm is tightly tied to the connectivity properties of the underlying random walk. As such, we propose an efficient random walk that uses geometrical information to circumvent the following inherent difficulties: avoiding overstepping strata, toning down concentration phenomena in high-dimensional spaces, and accommodating multidimensional distribution. Experiments on various models stress the importance of these improvements to make WL effective in challenging cases. Altogether, these improvements make it possible to compute density of states for regions of the phase space of small biomolecules.
Complete list of metadatas

Cited literature [41 references]  Display  Hide  Download
Contributor : Frederic Cazals <>
Submitted on : Tuesday, November 19, 2019 - 9:41:18 AM
Last modification on : Thursday, March 5, 2020 - 3:30:21 PM
Document(s) archivé(s) le : Thursday, February 20, 2020 - 3:03:22 PM


Files produced by the author(s)


  • HAL Id : hal-01919860, version 3


Augustin Chevallier, Frédéric Cazals. Wang-Landau Algorithm: an adapted random walk to boost convergence. [Research Report] RR-9223, INRIA Sophia Antipolis, France. 2019, pp.1-34. ⟨hal-01919860v3⟩



Record views


Files downloads