The parallel replica method for simulating long trajectories of Markov chains
From MaRDI portal
Abstract: The parallel replica dynamics, originally developed by A.F. Voter, efficiently simulates very long trajectories of metastable Langevin dynamics. We present an analogous algorithm for discrete time Markov processes. Such Markov processes naturally arise, for example, from the time discretization of a continuous time stochastic dynamics. Appealing to properties of quasistationary distributions, we show that our algorithm reproduces exactly (in some limiting regime) the law of the original trajectory, coarsened over the metastable states.
Recommendations
- The parallel replica method for computing equilibrium averages of Markov chains
- Stationary Averaging for Multiscale Continuous Time Markov Chains Using Parallel Replica Dynamics
- A generalized parallel replica dynamics
- A mathematical formalization of the parallel replica dynamics
- Numerical analysis of parallel replica dynamics
Cited in
(9)- Stationary Averaging for Multiscale Continuous Time Markov Chains Using Parallel Replica Dynamics
- Generalizing Parallel Replica Dynamics: Trajectory Fragments, Asynchronous Computing, and PDMPs
- The enhanced sampling in parallel finite-time dynamics method with replica exchange
- Numerical analysis of parallel replica dynamics
- A generalized parallel replica dynamics
- The parallel replica method for computing equilibrium averages of Markov chains
- Efficient simulation of Markov chains using segmentation
- A mathematical formalization of the parallel replica dynamics
- Shaken dynamics: an easy way to parallel Markov chain Monte Carlo
This page was built for publication: The parallel replica method for simulating long trajectories of Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2927899)