Generalizing Parallel Replica Dynamics: Trajectory Fragments, Asynchronous Computing, and PDMPs

Abstract

We study the Parallel Replica Dynamics in a general setting. We introduce a trajectory fragment framework that can be used to design and prove consistency of Parallel Replica algorithms for generic Markov processes. We use our framework to formulate a novel condition that guarantees an asynchronous algorithm is consistent. Exploiting this condition and our trajectory fragment framework, we present new synchronous and asynchronous Parallel Replica algorithms for piecewise deterministic Markov processes.

32 pages, 9 figures

References in corpus (6)

• Genealogical particle analysis of rare events
• Piecewise-Deterministic Markov Chain Monte Carlo
• Irreversible Langevin samplers and variance reduction: a large deviation approach
• Irreversible local Markov chains with rapid convergence towards equilibrium
• Self-optimized construction of transition rate matrices from accelerated atomistic simulations with Bayesian uncertainty quantification
• Parallel replica dynamics method for bistable stochastic reaction networks: simulation and sensitivity analysis