University of Cambridge > > Inference Group > Graph Transformation Method for Calculating Waiting Times in Markov Chains

Graph Transformation Method for Calculating Waiting Times in Markov Chains

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Phil Cowans.

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.

The paper associated with this talk can be viewed at

This talk is part of the Inference Group series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity