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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

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 http://www.trygub.com/gt/article/

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.

Other lists

Cambridge University Student Pugwash Society Talks POLIS Staff and PhD Student Colloquium ERC Equipoise

Other talks

100 Problems around Scalar Curvature The Particulars of Particulates: Granular Research on Dunes and Avalanches Attentional episodes and cognitive control In search of amethysts, black gold and yellow gold How language variation contributes to reading difficulties and “achievement gaps” Why Do We Need Another Biography of Hitler? Single Cell Seminars (November) Discovering regulators of insulin output with flies and human islets: implications for diabetes and pancreas cancer Singularities of Hermitian-Yang-Mills connections and the Harder-Narasimhan-Seshadri filtration Knot Floer homology and algebraic methods Lunchtime Talk: Helen's Bedroom What we don’t know about the Universe from the very small to the very big : ONE DAY MEETING
 

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