2013
DOI: 10.1103/physreve.88.053302
|View full text |Cite
|
Sign up to set email alerts
|

Dynamically optimized Wang-Landau sampling with adaptive trial moves and modification factors

Abstract: The density of states of continuous models is known to span many orders of magnitudes at different energies due to the small volume of phase space near the ground state. Consequently, the traditional Wang-Landau sampling which uses the same trial move for all energies faces difficulties sampling the low entropic states. We developed an adaptive variant of the Wang-Landau algorithm that very effectively samples the density of states of continuous models across the entire energy range. By extending the acceptanc… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0
1

Year Published

2014
2014
2020
2020

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 37 publications
0
7
0
1
Order By: Relevance
“…Therefore, most pairs of (M, M s ) considered can finish the simulation within a few minutes to a few hours. However, some edge windows may get 'stuck' at energy levels with low DOS [37,56,57] and do not converge after several days, especially when the sampling points include M s = 0. Therefore, we reject a simulation that does not finish in two days and re-start the run.…”
Section: G Simulation Timementioning
confidence: 99%
See 1 more Smart Citation
“…Therefore, most pairs of (M, M s ) considered can finish the simulation within a few minutes to a few hours. However, some edge windows may get 'stuck' at energy levels with low DOS [37,56,57] and do not converge after several days, especially when the sampling points include M s = 0. Therefore, we reject a simulation that does not finish in two days and re-start the run.…”
Section: G Simulation Timementioning
confidence: 99%
“…11). That means that if we we can get a perfect result with a small system size L s , when we consider a bigger system L b , the increment has to be chosen such that As the number of (M, M s ) pairs that must be sampled is L 4 /M 2 const , the minimum number The occurrence of 'stuck' simulation runs has also been observed in other WL based algorithms [37,56,57], particularly in phase regions of extreme energy and/or very low DOS. It is thus not a specific consequence of the macroscopic constraints in the present method.…”
Section: Generalizing the Scheme To Bigger Systemsmentioning
confidence: 99%
“…A more recent development in the metadynamics community concerns adaptive Gaussians [25], where the form of the update to the bias potential depends on local properties of the underlying free-energy surface. Similar ideas of applying different entropy updates in Wang-Landau simulations have circulated [26] and an ad-hoc method for nonuniform binning of energy levels has been recently and independently implemented [27]. To mention a final example, in efforts to develop massively parallel implementations, multiple parallel walkers have been simultaneously deployed to update a bias potential in metadynamics [28].…”
Section: Resultsmentioning
confidence: 99%
“…Energy bins are typically of uniform size for the entire energy continuum [23]. Some methods such as AdaWL [24] employ a tunable mechanism for controlling the binning for low entropic states in order to ensure the exploration of all energies. The method introduced in this paper is designed to scale appropriately as bin size is changed, but we do not test this scaling, as we use a system with discrete energy levels.…”
Section: Flat Histogram Methodsmentioning
confidence: 99%