Event-chain Monte Carlo algorithms for hard-sphere systems

Details Event-chain Monte Carlo algorithms for hard-sphere systems Event-chain Monte Carlo algorithms for hard-sphere systems

2009-03-17

arxiv.org/abs/0903.2954v2

Phys. Rev. E 80, 056704 (2009)

Physics

Condensed Matter

Statistical Mechanics

5 pages, 6 figures

Scientific paper

10.1103/PhysRevE.80.056704

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.

Affiliated with

Also associated with

No associations

Rating

Event-chain Monte Carlo algorithms for hard-sphere systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Event-chain Monte Carlo algorithms for hard-sphere systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Event-chain Monte Carlo algorithms for hard-sphere systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-491353