Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-10T05:05:40.666Z Has data issue: false hasContentIssue false
  • English
  • Français

Geometric Markov chains

Part of: Markov processes

Published online by Cambridge University Press:  14 July 2016

William Rising
Get access Rights & Permissions [Opens in a new window]

Abstract

A generalization of the familiar birth–death chain, called the geometric chain, is introduced and explored. By the introduction of two families of parameters in addition to the infinitesimal birth and death rates, the geometric chain allows transitions beyond the nearest neighbor, but is shown to retain the simple computational formulas of the birth–death chain for the stationary distribution and the expected first-passage times between states. It is also demonstrated that even when not reversible, a reversed geometric chain is again a geometric chain.

Keywords

REVERSIBILITYSTATIONARY DISTRIBUTIONSEXPECTED FIRST-PASSAGE TIMES

MSC classification

Primary: 60J25: Continuous-time Markov processes on general state spaces

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 32 , Issue 2 , June 1995 , pp. 349 - 374
Copyright
Copyright © Applied Probability Trust 1995 

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.)

Article purchase

Temporarily unavailable

References

[1] Anderson, W. J. (1991) Continuous-Time Markov Chains — An Applications Oriented Approach. Springer-Verlag, New York.Google Scholar
[2] Hunter, J. J. (1982) Generalized inverses and their application to applied probability problems. Linear Algebra Appl. 45, 157–198.Google Scholar
[3] Karlin, S. and Taylor, H. M. (1975) A First Course in Stochastic Processes, 2nd edn. Academic Press, New York.Google Scholar
[4] Kelly, F. P. (1979) Reversibility and Stochastic Networks, Wiley, New York.Google Scholar
[5] Kemeny, J. G. and Snell, J. L. (1960) Finite Markov Chains. Van Nostrand, Princeton, NJ.Google Scholar
[6] Onozato, Y. and Noguchi, S. (1985) On the thrashing cusp in slotted aloha systems. IEEE Trans. Comm. 33, 1171–1182.Google Scholar
[7] Brockwell, P. J., Gani, J. and Resnick, S. I. (1982) Birth, immigration and catastrophe processes. Adv. Appl. Prob. 14, 709–732.CrossRefGoogle Scholar
[8] Rising, W. (1989) Exponential chains and generalized inverses: New approaches to the approximate and exact solution of Markov chain problems. Unpublished.Google Scholar
[9] Rising, W. (1991) Applications of generalized inverses to Markov chains. Adv. Appl. Prob. 23, 293–302.Google Scholar
[10] Rosenkrantz, W. and Rising, W. (1987) On the expected time to collapse of the slotted aloha protocol. A paper which among other things shows that some Markov chains seem to be well approximated by using a birth–death chain whose drift and variance at each state are the same as that of the original chain. Unpublished.Google Scholar