Graph Transformation Method for Calculating Waiting Times in Markov Chains
Preprint
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 non-stochastic and non-iterative 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 5 references indexed in Scilit:
- Energy landscapes of model glasses. II. Results for constant pressureThe Journal of Chemical Physics, 2003
- One Thousand Exercises in Probability2001
- Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science ApplicationsJournal of the American Statistical Association, 2000
- Introductory Graph Theory.The American Mathematical Monthly, 1987
- Stochastic Processes in Physics and ChemistryPhysics Today, 1983