Event-chain Monte Carlo algorithms for hard-sphere systems
- 18 November 2009
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 80 (5), 056704
- https://doi.org/10.1103/physreve.80.056704
Abstract
In this paper we present the event-chain algorithms, which are fast Markov-chain Monte Carlo methods for hard spheres and related systems. In a single move of these rejection-free methods, an arbitrarily long chain of particles is displaced, and long-range coherent motion can be induced. Numerical simulations show that event-chain algorithms clearly outperform the conventional Metropolis method. Irreversible versions of the algorithms, which violate detailed balance, improve the speed of the method even further. We also compare our method with a recent implementations of the molecular-dynamics algorithm.Keywords
Other Versions
This publication has 21 references indexed in Scilit:
- Large-scale simulations of the two-dimensional melting of hard disksPhysical Review E, 2006
- Collective Monte Carlo Updating for Spin SystemsPhysical Review Letters, 1989
- Nonuniversal critical dynamics in Monte Carlo simulationsPhysical Review Letters, 1987
- Dislocation-mediated melting in two dimensionsPhysical Review B, 1979
- Melting and the vector Coulomb gas in two dimensionsPhysical Review B, 1979
- Theory of Two-Dimensional MeltingPhysical Review Letters, 1978
- Decay of the Velocity Autocorrelation FunctionPhysical Review A, 1970
- Phase Transition in Elastic DisksPhysical Review B, 1962
- Phase Transition for a Hard Sphere SystemThe Journal of Chemical Physics, 1957
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953