BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Graph Transformation Method for Calculating Waiting Times in Marko
 v Chains - Semen Trygubenko\, Department of Chemistry\, University of Camb
 ridge
DTSTART:20060328T130000Z
DTEND:20060328T140000Z
UID:TALK4829@talks.cam.ac.uk
CONTACT:Phil Cowans
DESCRIPTION:We describe an exact approach for calculating transition proba
 bilities\nand waiting times in finite-state discrete-time Markov processes
 .\nAll 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 n
 on-iterative fashion. In particular\, we can calculate the mean first pass
 age time between arbitrary groups of stationary points for discrete path s
 ampling databases\,\nand hence extract phenomenological rate constants. We
  present a number of examples to demonstrate the efficiency and robustness
  of this approach.\n\nThe paper associated with this talk can be viewed at
   http://www.trygub.com/gt/article/
LOCATION:Ryle Seminar Room\, Cavendish Laboratory
END:VEVENT
END:VCALENDAR