Hostname: page-component-6766d58669-r8qmj Total loading time: 0 Render date: 2026-05-16T06:38:27.844Z Has data issue: false hasContentIssue false
  • English
  • Français

The Relaxation time for truncated birth-death processes

Published online by Cambridge University Press:  27 July 2009

Julian Keilson  and
Ravi Ramaswamy
Julian Keilson
Affiliation:
University of Rochester, Rochester, New York 14627
Ravi Ramaswamy
Affiliation:
BGS Systems Inc. Waltham, Massachusetts 02254-9111
Get access Rights & Permissions [Opens in a new window]

Abstract

The relaxation time for an ergodic Markov process is a measure of the time until ergodicity is reached from its initial state. In this paper the relaxation time for an ergodic truncated birth-death process is studied. It is shown that the relaxation time for such a process on states {0,1, …, N} is the quasi-stationary exit time from the set {,2, …, N{0,1,…, N, N + 1} with two-sided absorption at states 0 and N + 1. The existence of such a dual process has been observed by Siegmund [15] for stochastically monotone Markov processes on the real line. Exit times for birth- death processes with two absorbing states are studied and an efficient algorithm for the numerical evaluation of mean exit times is presented. Simple analytical lower bounds for the relaxation times are obtained. These bounds are numerically accessible. Finally, the sensitivity of the relaxation time to variations in birth and death rates is studied.

Information

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 1 , Issue 4 , October 1987 , pp. 367 - 381
Copyright
Copyright © Cambridge University Press 1987

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

Callaert, H. & Keilson, J. (1973). On the exponential ergodicity and spectral structure for birth-death processes I, Stoch. Proc. Appl. 1: 187–216.CrossRefGoogle Scholar
Callaert, H. & Keilson, J. (1973). On the exponential ergodicity and spectral structure for birth-death processes II, Stoch. Proc. Appl. 1: 216–235.Google Scholar
Cohen, J.W. (1970). The single server queue. Amsterdam: North-Holland Press.Google Scholar
Darroch, J. & Seneta, E. (1969). On quasi-stationary distributions in absorbing continuous-time finite Markov chains. J. Appl. Prob. 4: 192–196.CrossRefGoogle Scholar
Keilson, J. (1978). Markov chain models–Rarity and exponentiality. New York: Springer-Verlag.Google Scholar
Keilson, J., Machihara, F., & Sumita, U. (1985). On the spectral structure of the M/HK/l queue. ITC II Kyoto.Google Scholar
Keilson, J. & Kester, A. (1977). Monotone matrices and monotone Markov processes. Stoch. Proc. Appl. 5: 181–198.CrossRefGoogle Scholar
Keilson, J. & Ramaswamy, R. (1984). Convergence of quasi-stationary distributions in birth-death processes. Stoch. Proc. Appl. 18: 301–312.CrossRefGoogle Scholar
Keilson, J. & Ramaswamy, R. (1986). The bivariate maximum process and quasi-stationary structure of birth-death processes. Stoch. Proc. Appl. 22: 27–36.CrossRefGoogle Scholar
Kemeny, J. & Snell, J. (1960). Finite Markov chains. Princeton, New Jersey: Van Nostrand.Google Scholar
Ledermann, W. & Reuter, G.E.H. (1954). Spectral theory for the differential equations of simple birth-death processes. Phil. Trans. Royal Soc. A246: 321–369.Google Scholar
Noble, B. & Daniel, J.S. (1977). Applied Linear Algebra. New Jersey: Prentice-Hall.Google Scholar
Pollak, M. & Siegmund, D. (1984). Convergence of quasi-stationary distributions to stationary distributions. Technical Report, Department of Statistics, Stanford University.Google Scholar
Ramaswamy, R. (1985). Aspects of quasi-stationarity, exponentiality, and relaxation times in birth-death processes. Ph.D. Thesis, University of Rochester, New York.Google Scholar
Siegmund, D. (1976). The equivalence of absorbing and reflecting barrier problems for stochastically monotone Markov process. Ann. Prob. 4: 914–919.CrossRefGoogle Scholar
Van Doorn, E. (1981). Stochastic monotonicity and queueing applications of birth-death processes. New York: Springer-Verlag.CrossRefGoogle Scholar