Abstract.
We propose a mathematical analysis of a well-known numerical approach used in molecular dynamics to efficiently sample a coarse-grained description of the original trajectory (in terms of state-to-state dynamics). This technique is called parallel replica dynamics and has been introduced by Arthur F. Voter. The principle is to introduce many replicas of the original dynamics, and to consider the first transition event observed among all the replicas. The effective physical time is obtained by summing up all the times elapsed for all replicas. Using a parallel implementation, a speed-up of the order of the number of replicas can thus be obtained, allowing longer time scales to be computed. By drawing connections with the theory of Markov processes and, in particular, exploiting the notion of quasi-stationary distribution, we provide a mathematical setting appropriate for assessing theoretically the performance of the approach, and possibly improving it.
© 2012 by Walter de Gruyter Berlin Boston
Articles in the same Issue
- Masthead
- On the population median estimation using robust extreme ranked set sampling
- A mathematical formalization of the parallel replica dynamics
- A restarted estimation of distribution algorithm for solving sudoku puzzles
- Parallel random number generators in Monte Carlo derivative pricing: An application-based test
- Probabilistic error bounds for the discrepancy of mixed sequences
Articles in the same Issue
- Masthead
- On the population median estimation using robust extreme ranked set sampling
- A mathematical formalization of the parallel replica dynamics
- A restarted estimation of distribution algorithm for solving sudoku puzzles
- Parallel random number generators in Monte Carlo derivative pricing: An application-based test
- Probabilistic error bounds for the discrepancy of mixed sequences