Rejection-free Monte-Carlo sampling for general potentials

Abstract

A Monte Carlo method to sample the classical configurational canonical ensemble is introduced. In contrast to the Metropolis algorithm, where trial moves can be rejected, in this approach collisions take place. The implementation is event-driven, i.e., at scheduled times the collisions occur. A unique feature of the new method is that smooth potentials (instead of only step-wise changing ones) can be used. Besides an event-driven approach where all particles move simultaneously, we also introduce a straight event-chain implementation. As proof-of-principle a system of Lennard-Jones particles is simulated.

References in corpus (2)

• Two-step melting in two dimensions: First-order liquid-hexatic transition
• Efficiency of Rejection-Free Methods for Dynamic Monte Carlo Studies of Off-lattice Interacting Particles

Cited by in corpus (61)

• 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
• Piecewise-Deterministic Markov Chain Monte Carlo
• Piecewise Deterministic Markov Processes for Continuous-Time Monte Carlo
• The race to the bottom: approaching the ideal glass?
• Ergodicity of the zigzag process
• Event-chain Monte Carlo: foundations, applications, and prospects
• A piecewise deterministic scaling limit of Lifted Metropolis-Hastings in the Curie-Weiss model
• Piecewise Deterministic Markov Processes for Scalable Monte Carlo on Restricted Domains
• 3-Regular 3-XORSAT Planted Solutions Benchmark of Classical and Quantum Heuristic Optimizers
• Event-chain Monte Carlo for classical continuous spin models
• Irreversible local Markov chains with rapid convergence towards equilibrium
• 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
• Cell-veto Monte Carlo algorithm for long-range systems
• Phase transitions and ordering structures of a model of chiral helimagnet in three dimensions
• Efficient Equilibration of Hard Spheres with Newtonian Event Chains
• All-atom computations with irreversible Markov chains
• Limit theorems for the Zig-Zag process
• Learning Neural Event Functions for Ordinary Differential Equations
• Policy Guided Monte Carlo: Reinforcement Learning Markov Chain Dynamics
• A piecewise deterministic Monte Carlo method for diffusion bridges
• JeLLyFysh-Version1.0 -- a Python application for all-atom event-chain Monte Carlo
• On explicit $L^2$-convergence rate estimate for piecewise deterministic Markov processes in MCMC algorithms
• Event-Chain Monte-Carlo Simulations of Dense Soft Matter Systems
• Dynamical computation of the density of states and Bayes factors using nonequilibrium importance sampling
• Event-chain Monte Carlo with factor fields
• Exchanging replicas with unequal cost, infinitely and permanently
• PDMP characterisation of event-chain Monte Carlo algorithms for particle systems
• Concepts in Monte Carlo sampling
• Large-scale dynamics of event-chain Monte Carlo
• Geometric Methods for Sampling, Optimisation, Inference and Adaptive Agents
• Molecular simulation from modern statistics: Continuous-time, continuous-space, exact
• Anomalous diffusion analysis of the lifting events in the event-chain Monte Carlo for the classical XY models
• Peskun-Tierney ordering for Markov chain and process Monte Carlo: beyond the reversible scenario
• Lifted TASEP: a Bethe ansatz integrable paradigm for non-reversible Markov chains
• Cores for Piecewise-Deterministic Markov Processes used in Markov Chain Monte Carlo
• Large-scale inference of correlation among mixed-type biological traits with phylogenetic multivariate probit models
• Schr{ö}dinger-F{ö}llmer Sampler: Sampling without Ergodicity
• Binary Bouncy Particle Sampler
• Complexity of zigzag sampling algorithm for strongly log-concave distributions
• Concentration Inequalities and UQ Bounds for Hypocoercive MCMC Samplers
• Freezing line of polydisperse hard spheres via direct-coexistence simulations
• Meaningful timescales from Monte Carlo simulations of molecular systems with hard-core interactions
• The Coordinate Sampler: A Non-Reversible Gibbs-like MCMC Sampler
• Irreversible swap algorithms for soft sphere glasses
• Event-scheduling algorithms with Kalikow decomposition for simulating potentially infinite neuronal networks
• Sampling algorithms in statistical physics: a guide for statistics and machine learning
• Fast event-driven simulations for soft spheres: from dynamics to Laves phase nucleation
• Velocity jump processes : an alternative to multi-timestep methods for faster and accurate molecular dynamics simulations
• Velocity Jumps for Molecular Dynamics
• Non-reversible, tuning- and rejection-free Markov chain Monte Carlo via iterated random functions
• Analysis of high-dimensional Continuous Time Markov Chains using the Local Bouncy Particle Sampler
• Large Deviations of Irreversible Processes
• Piecewise deterministic sampling with splitting schemes
• Zigzag path connects two Monte Carlo samplers: Hamiltonian counterpart to a piecewise deterministic Markov process
• Event-driven Monte Carlo algorithm for general potentials
• Super-Efficient Exact Hamiltonian Monte Carlo for the von Mises Distribution
• Accelerating Multicanonical Sampling with Irreversibility
• Estimation and uncertainty quantification for the output from quantum simulators