Graph transformation method for calculating waiting times in Markov chains
- 21 June 2006
- journal article
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 124 (23) , 234110
Abstract
We describe an exact approach for calculating transition probabilities and waiting times in finite-state discrete-time Markov processes. All the states and the rules for transitions between them must be known in advance. We can then calculate averages over a given ensemble of paths for both additive and multiplicative properties in a nonstochastic and noniterative fashion. In particular, we can calculate the mean first-passage time between arbitrary groups of stationary points for discrete path sampling databases, and hence extract phenomenological rate constants. We present a number of examples to demonstrate the efficiency and robustness of this approach.Keywords
All Related Versions
This publication has 56 references indexed in Scilit:
- Kinetic Monte Carlo simulation of formation of microstructures in liquid dropletsNew Journal of Physics, 2004
- Folding of the GB1 hairpin peptide from discrete path samplingThe Journal of Chemical Physics, 2004
- Coarse-grain molecular dynamics simulations of diblock copolymer surfactants interacting with a lipid bilayerMolecular Physics, 2004
- The free energy landscape and dynamics of met-enkephalinThe Journal of Chemical Physics, 2003
- Kinetic Monte Carlo simulation of the effect of coalescence energy release on the size and shape evolution of nanoparticles grown as an aerosolThe Journal of Chemical Physics, 2003
- Discrete path samplingMolecular Physics, 2002
- Queueing Networks and Markov Chains1998
- Collective surface diffusion: -fold way kinetic Monte Carlo simulationPhysical Review E, 1998
- Theoretical foundations of dynamical Monte Carlo simulationsThe Journal of Chemical Physics, 1991
- A new algorithm for Monte Carlo simulation of Ising spin systemsJournal of Computational Physics, 1975