Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-29T05:58:34.880Z Has data issue: false hasContentIssue false
  • English
  • Français

Some passage-time generating functions for discrete-time and 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]

Abstract

Let T denote a subset of the possible transitions between the states of a finite Markov chain and let Yk denote the time of the kth occurrence of a T-transition. Formulae are derived for the generating functions of Yk, of Yj + k — Yj and of Yj + k — Yj in the limit as j → ∞, for both discrete-time and continuoustime chains. Several particular cases are briefly discussed.

Type
Research Papers
Information
Journal of Applied Probability , Volume 4 , Issue 3 , November 1967 , pp. 496 - 507
Copyright
Copyright © Applied Probability Trust 

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

Bartlett, M. S. (1962) Stochastic Processes. 2nd edition. Cambridge U. Press.Google Scholar
Cox, D. R. and Miller, H. D. (1965) The Theory of Stochastic Processes. Methuen, London.Google Scholar
Darroch, J. N. (1966) Identities for passage times with applications to recurrent events and homogeneous differential functions. J. Appl. Prob. 3, 435–444.CrossRefGoogle Scholar
Kemeny, John G. and Snell, J. L. (1960) Finite Markov Chains. Van Nostrand, Princeton, N.J. Google Scholar