2001
DOI: 10.1103/physrevlett.86.2050
|View full text |Cite
|
Sign up to set email alerts
|

Efficient, Multiple-Range Random Walk Algorithm to Calculate the Density of States

Abstract: 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 al… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

37
2,943
2
55

Year Published

2007
2007
2017
2017

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 2,838 publications
(3,037 citation statements)
references
References 25 publications
37
2,943
2
55
Order By: Relevance
“…This iterative approach to the problem 28,29 led to the development of adaptive biasing potential methods that improve the potential "on the fly", 16,17,19,30 i.e., while the simulation is performed. All these methods share the common basic idea, namely, "to introduce the concept of memory" 30 during a simulation by changing the potential of mean force perceived by the system, in order to penalize conformations that have been already sampled before.…”
Section: Metadynamics Simulation: History-dependent Algorithms In Nonmentioning
confidence: 99%
See 1 more Smart Citation
“…This iterative approach to the problem 28,29 led to the development of adaptive biasing potential methods that improve the potential "on the fly", 16,17,19,30 i.e., while the simulation is performed. All these methods share the common basic idea, namely, "to introduce the concept of memory" 30 during a simulation by changing the potential of mean force perceived by the system, in order to penalize conformations that have been already sampled before.…”
Section: Metadynamics Simulation: History-dependent Algorithms In Nonmentioning
confidence: 99%
“…Quasi-equilibrium techniques [16][17][18][19] build such biasing potential by periodically adding a small perturbation to the system Hamiltonian so as to progressively flatten the free energy surface along selected reaction coordinates. For example, in the so-called "metadynamics" simulation method, 16 a history-dependent potential, made of Gaussian functions deposed continuously at the instantaneous values of the given reaction coordinates, is imposed to the system.…”
Section: Introductionmentioning
confidence: 99%
“…We have used here expanded ensemble density of states (EXEDOS) 31,32 calculations to compute the grand potential of the system, which is the thermodynamic potential of the grand canonical ensemble O(m,N), as a function of chemical potential of the adsorbate, m, and number of adsorbed molecules, N. This method, developed by Wang and Landau, calculates the density of states of the system on the fly, using biased Monte Carlo simulations. 33,34 It has been successfully used for a wide range of system, including Lennard-Jones fluids 35 and simulations of adsorption in zeolites. [23][24][25] For detailed about the implementation used here, the reader is referred to ref.…”
Section: Density Of States Calculationsmentioning
confidence: 99%
“…Here we use the Wang-Landau algorithm [35,36] to approximate w flat as input for Metropolis-Hastings sampling.…”
Section: Methodsmentioning
confidence: 99%