Bernard Krauth Wilson 2009

From Werner KRAUTH

(Difference between revisions)
Jump to: navigation, search
Revision as of 11:55, 6 March 2011
Werner (Talk | contribs)

← Previous diff
Revision as of 19:50, 12 March 2011
Werner (Talk | contribs)

Next diff →
Line 10: Line 10:
speed of the method even further. We also compare our method with speed of the method even further. We also compare our method with
a recent implementations of the molecular dynamics algorithm. a recent implementations of the molecular dynamics algorithm.
 +
 +'''Further information:''' We used this algorithm, which is about 100 times faster than the local Metropolis algorith, for our [[Bernard Krauth 2011|work on the liquid-hexatic transition in two-dimensional hard disks.]]

Revision as of 19:50, 12 March 2011

E. P. Bernard, W. Krauth, D. B. Wilson Event-chain algorithms for hard-sphere systems Physical Review E 80 056704 (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 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.

Further information: We used this algorithm, which is about 100 times faster than the local Metropolis algorith, for our work on the liquid-hexatic transition in two-dimensional hard disks.


Electronic version (from arXiv)

Move of the Event-chain algorithm


Personal tools