PDMP characterisation of event-chain Monte Carlo algorithms for particle systems

Abstract

Monte Carlo simulations of systems of particles such as hard spheres or soft spheres with singular kernels can display around a phase transition prohibitively long convergence times when using traditional Hasting-Metropolis reversible schemes. Efficient algorithms known as event-chain Monte Carlo were then developed to reach necessary accelerations. They are based on non-reversible continuous-time Markov processes. Proving invariance and ergodicity for such schemes cannot be done as for discrete-time schemes and a theoretical framework to do so was lacking, impeding the generalisation of ECMC algorithms to more sophisticated systems or processes. In this work, we characterize the Markov processes generated in ECMC as piecewise deterministic Markov processes. It first allows us to propose more general schemes, for instance regarding the direction refreshment. We then prove the invariance of the correct stationary distribution. Finally, we show the ergodicity of the processes in soft- and hard-sphere systems, with a density condition for the latter.

References in corpus (17)

• Two-step melting in two dimensions: First-order liquid-hexatic transition
• 2D Melting: From Liquid-Hexatic Coexistence to Continuous Transitions
• Event-chain Monte Carlo algorithms for hard-sphere systems
• Generalized event-chain Monte Carlo: Constructing rejection-free global-balance algorithms from infinitesimal steps
• The Zig-Zag Process and Super-Efficient Sampling for Bayesian Analysis of Big Data
• Rejection-free Monte-Carlo sampling for general potentials
• Irreversible Monte Carlo Algorithms for Efficient Sampling
• Invariant densities for dynamical systems with random switching
• Piecewise Deterministic Markov Processes for Continuous-Time Monte Carlo
• Ergodicity of the zigzag process
• Event-chain Monte Carlo for classical continuous spin models
• Event-chain Monte Carlo algorithms for three- and many-particle interactions
• Event-chain algorithm for the Heisenberg model: Evidence for $z\simeq 1$ dynamic scaling
• Monte Carlo Simulation of Dense Polymer Melts Using Event Chain Algorithms
• Efficient Equilibration of Hard Spheres with Newtonian Event Chains
• Geometric ergodicity of Langevin dynamics with Coulomb interactions
• Cores for Piecewise-Deterministic Markov Processes used in Markov Chain Monte Carlo

Cited by in corpus (1)

• Sampling algorithms in statistical physics: a guide for statistics and machine learning