| Event-chain algorithms for hard-sphere systems (2009) | |||||||||
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 methods. Irreversible versions of the algorithms, which violate detailed balance, improve the speed of the method even further.. Comment: 4 pages, 5 figures | |||||||||
Publication details | |||||||||
| |||||||||