Generalized event-chain Monte Carlo: constructing rejection-free global-balance algorithms from infinitesimal steps.

In this article, we present an event-driven algorithm that generalizes the recent hard-sphere event-chain Monte Carlo method without introducing discretizations in time or in space. A factorization of the Metropolis filter and the concept of infinitesimal Monte Carlo moves are used to design a rejection-free Markov-chain Monte Carlo algorithm for particle systems with arbitrary pairwise interactions. The algorithm breaks detailed balance, but satisfies maximal global balance and performs better than the classic, local Metropolis algorithm in large systems. The new algorithm generates a continuum of samples of the stationary probability density. This allows us to compute the pressure and stress tensor as a byproduct of the simulation without any additional computations.

[1]  W. Krauth,et al.  Sampling from a polytope and hard-disk Monte Carlo , 2013, 1301.4901.

[2]  Sharon C Glotzer,et al.  Hard-disk equation of state: first-order liquid-hexatic transition in two dimensions with three simulation methods. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Gerd E. Schröder-Turk,et al.  Shortcomings of the bond orientational order parameters for the analysis of disordered particulate matter. , 2012, The Journal of chemical physics.

[4]  E A J F Peters,et al.  Rejection-free Monte Carlo sampling for general potentials. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Martin Weigel,et al.  Non-reversible Monte Carlo simulations of spin models , 2011, Comput. Phys. Commun..

[6]  Werner Krauth,et al.  Two-step melting in two dimensions: first-order liquid-hexatic transition. , 2011, Physical review letters.

[7]  Werner Krauth,et al.  Event-chain Monte Carlo algorithms for hard-sphere systems. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Michael Chertkov,et al.  Irreversible Monte Carlo Algorithms for Efficient Sampling , 2008, ArXiv.

[9]  H. Caussinus,et al.  Journal De La Société Française De Statistique , 2006 .

[10]  W. Krauth.  Statistical Mechanics: Algorithms and Computations , 2006 .

[11]  Erik Luijten,et al.  Rejection-free geometric cluster algorithm for complex fluids. , 2004, Physical review letters.

[12]  Radford M. Neal,et al.  ANALYSIS OF A NONREVERSIBLE MARKOV CHAIN SAMPLER , 2000 .

[13]  Paul Gustafson,et al.  A guided walk Metropolis algorithm , 1998, Stat. Comput..

[14]  Andreas Jaster,et al.  An improved Metropolis algorithm for hard core systems , 1997, cond-mat/9711256.

[15]  Klaus Zahn,et al.  Hydrodynamic Interactions May Enhance the Self-Diffusion of Colloidal Particles , 1997 .

[16]  Werner Krauth,et al.  Cluster algorithm for hard spheres and related systems , 1995 .

[17]  Wolff,et al.  Collective Monte Carlo updating for spin systems. , 1989, Physical review letters.

[18]  R. J. Speedy.  Pressure of hard-sphere systems , 1988 .

[19]  Katherine J. Strandburg,et al.  Two-dimensional melting , 1988 .

[20]  A. Kennedy,et al.  Hybrid Monte Carlo , 1988 .

[21]  Wang,et al.  Nonuniversal critical dynamics in Monte Carlo simulations. , 1987, Physical review letters.

[22]  I. R. Mcdonald,et al.  Theory of simple liquids , 1998 .

[23]  A. B. Bortz,et al.  A new algorithm for Monte Carlo simulation of Ising spin systems , 1975 .

[24]  B. Alder,et al.  Studies in Molecular Dynamics. II. Behavior of a Small Number of Elastic Spheres , 1960 .

[25]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.