Graph Transformation Method for Calculating Waiting Times in Markov Chains
arXiv:cond-mat/0603830 · doi:10.1063/1.2198806
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.
58 pages, 10 figures, 1 table and 3 algorithms (given in pseudocode)
References in corpus (4)
- Kinetics of protein-DNA interaction: facilitated target location in sequence-dependent potential
- The long reach of DNA sequence heterogeneity in diffusive processes
- Characterizing the network topology of the energy landscapes of atomic clusters
- Kinetic Analysis of Discrete Path Sampling Stationary Point Databases