Efficient, multiple-range random walk algorithm to calculate the density of states.
By Fugao Wang, D. Landau. Physical Review Letters, 2000
2,385 citations recorded by the source corpus.
We present a new Monte Carlo algorithm that produces results of high accuracy with reduced simulational effort. Independent random walks are performed (concurrently or serially) in different, restricted ranges of energy, and the resultant density of states is modified continuously to produce locally flat histograms. This method permits us to directly access the free energy and entropy, is independent of temperature, and is efficient for the study of both 1st order and 2nd order phase transitions. It should also be useful for the study of complex systems with a rough energy landscape.
Subfields: Condensed Matter Physics, Materials Chemistry, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/0fba1e23d617affbb52d75bdc329bd72b2a00535
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Condensed Matter Physics
- Tony Lelièvre
- Ariana Torres-Knoop
- Karsten Reuter
- Andrew Gelman
- Ruslan Salakhutdinov
- Christian P. Robert
- David Dubbeldam
- Matthias Scheffler
In Materials Chemistry
- C. Stampfl
- Matthias Scheffler
- Karsten Reuter
- Ariana Torres-Knoop
- Andrew Gelman
- Ruslan Salakhutdinov
- Christian P. Robert
- David Dubbeldam
In Mathematical Physics
- Ariana Torres-Knoop
- Karsten Reuter
- Andrew Gelman
- Ruslan Salakhutdinov
- Christian P. Robert
- David Dubbeldam
- Matthias Scheffler
- Song-Chun Zhu
Citations in the corpus
- Learning Deep Boltzmann Machines using Adaptive MCMC (2010, background): “A recent breakthrough, introduced by (Wang & Landau, 2001), solves both the weight estimation and sampling problem in a single run.”
- Building a Telescope to Look Into High-Dimensional Image Spaces (2018, background): “Ideally, in each step of the ADELM Algorithm, diffusion to only one basin representative Z j should be successful.”
- On the inner workings of Monte Carlo codes (2013, methodology): “The computation of the partition function by numerical approximation is the basis for many DOS methods,[241] such as the reference system equilibration (RSE) method, [242] histogramming,[243,244] multihistogramming, [245,246] the histogram reweighting method,[247,248] the Wang–Landau sampling,[249,2”
- Markov Chain Monte Carlo Simulations and Their Statistical Analysis (2004, methodology): “The Wang-Landau Recursion [23]: Updates are performed with estimators g(E) of the density of states p(E1 → E2) = min [ g(E1) g(E2) , 1 ] .”
- Bayesian computation: a perspective on the current state, and sampling backwards and forwards (2015, methodology): “A last comment about this innovative paper is that the adaptive construction of the partition has much in common with Wang-Landau schemes (Wang and Landau 2001; Atchad´e and Liu 2004; Lee et al. 2005; Jacob and Ryder 2014).”
- Bayesian computation: a summary of the current state, and samples backwards and forwards (2015, methodology): “A last comment about this innovative paper is that the adaptive construction of the partition has much in common with Wang–Landau schemes (Wang and Landau 2001; Lee et al. 2005; Atchadé and Liu 2010; Jacob and Ryder 2014).”
- AB Initio Atomistic Thermodynamics and Statistical Mechanics of Surface Properties and Functions (2004, methodology): “In fact, quite a number of non-equilibrium problems may already be tackled on the basis of this uncalibrated “MC time” (Landau and Binder, 2002).”