Efficient, Multiple-Range Random Walk Algorithm to Calculate the Density of States
Top Cited Papers
- 5 March 2001
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 86 (10) , 2050-2053
- https://doi.org/10.1103/physrevlett.86.2050
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 also be useful for the study of complex systems with a rough energy landscape.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Monte Carlo algorithms based on the number of potential movesComputer Physics Communications, 2000
- Partition Function Zeros and Finite Size Scaling of Helix-Coil Transitions in a PolypeptidePhysical Review Letters, 2000
- Transition Matrix Monte Carlo Reweighting and DynamicsPhysical Review Letters, 1999
- Broad histogram relation is exactZeitschrift für Physik B Condensed Matter, 1998
- Multioverlap Simulations of the 3D Edwards-Anderson Ising Spin GlassPhysical Review Letters, 1998
- Multibondic Cluster Algorithm for Monte Carlo Simulations of First-Order Phase TransitionsPhysical Review Letters, 1995
- Multicanonical ensemble: A new approach to simulate first-order phase transitionsPhysical Review Letters, 1992
- Finite-size effects at temperature-driven first-order transitionsPhysical Review B, 1986
- The Potts modelReviews of Modern Physics, 1982
- Finite-size behavior of the Ising square latticePhysical Review B, 1976