Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-29T03:47:04.506Z Has data issue: false hasContentIssue false
  • English
  • Français

Passage-time generating functions for continuous-time finite Markov chains

Published online by Cambridge University Press:  14 July 2016

J. N. Darroch  and
K. W. Morris
J. N. Darroch
Affiliation:
Flinders University of South Australia
K. W. Morris
Affiliation:
University of Adelaide
Get access Rights & Permissions [Opens in a new window]

Extract

Let S denote a subset of the states of a finite continuous-time Markov chain and let Y(a) denote the time that elapses until a weighted sum of a time units have been spent in S. Formulae are derived for the generating functions of Y(a) and of Y(a + b) – Y(b).

Type
Research Papers
Information
Journal of Applied Probability , Volume 5 , Issue 2 , August 1968 , pp. 414 - 426
Copyright
Copyright © Applied Probability Trust 1968 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Darroch, J. N. (1966) Identities for passage times with applications to recurrent events and homogeneous differential functions. J. Appl. Prob. 3, 435–444.Google Scholar
Darroch, J. N. and Morris, K. W. (1967) Some passage-time generating functions for discrete-time and continuous-time finite Markov chains. J. Appl. Prob. 4, 496–507.Google Scholar
Takács, L. (1960) Stochastic Processes. Methuen, London.Google Scholar