Physical Review E · 2009 · 195 citations · 20 references
Natural SciencesPhysicsComputational MechanicsComputational PhysicsCondensed Matter PhysicsMarkov Chain Monte CarloMolecular DynamicsMonte Carlo MethodsMonte Carlo SimulationSimulation MethodsStatistical MechanicsDetailed BalanceHard Sphere ModelsHard-sphere ModelMetropolis AlgorithmMetropolis-hastings AlgorithmMonte Carlo Sampling
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.
20
Equation of State Calculations by Fast Computing Machines
N. Metropolis, Arianna W. Rosenbluth, M. N. Rosenbluth et al. · The Journal of Chemical Physics · 1953 · 37.1K citations
Collective Monte Carlo Updating for Spin Systems
Ulli Wolff · Physical Review Letters · 1989 · 2.6K citations