Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-24T02:51:20.490Z Has data issue: false hasContentIssue false
  • English
  • Français

Hazard rate and reversed hazard rate monotonicities in continuous-time Markov chains

Part of: Markov processes

Published online by Cambridge University Press:  14 July 2016

Masaaki Kijima
Masaaki Kijima*
Affiliation:
Tokyo Metropolitan University
*
∗Postal address: Faculty of Economics, Tokyo Metropolitan University, 1–1 Minami-Ohsawa, Hachiohji, Tokyo 192–0397, Japan. Email address: [email protected].
Get access Rights & Permissions [Opens in a new window]

Abstract

A continuous-time Markov chain on the non-negative integers is called skip-free to the right (left) if only unit increments to the right (left) are permitted. If a Markov chain is skip-free both to the right and to the left, it is called a birth–death process. Karlin and McGregor (1959) showed that if a continuous-time Markov chain is monotone in the sense of likelihood ratio ordering then it must be an (extended) birth–death process. This paper proves that if an irreducible Markov chain in continuous time is monotone in the sense of hazard rate (reversed hazard rate) ordering then it must be skip-free to the right (left). A birth–death process is then characterized as a continuous-time Markov chain that is monotone in the sense of both hazard rate and reversed hazard rate orderings. As an application, the first-passage-time distributions of such Markov chains are also studied.

Keywords

Monotone Markov chainbirth–death processstochastic orderingfirst-passage-time distribution

MSC classification

Primary: 60J35: Transition functions, generators and resolvents
Secondary: 60J27: Continuous-time Markov processes on discrete state spaces
Type
Research Papers
Information
Journal of Applied Probability , Volume 35 , Issue 3 , September 1998 , pp. 545 - 556
Copyright
Copyright © Applied Probability Trust 1998 

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

Anderson, W. J. (1991). Continuous-Time Markov Chains – An Applications-Oriented Approach. Springer, New York.Google Scholar
Assaf, D., Shaked, M., and Shanthikumar, J. G. (1985). First-passage times with PF r densities. J. Appl. Prob. 22, 185–196.Google Scholar
Brockwell, P. J. (1985). The extinction time of a birth, death and catastrophe process and of a related diffusion model. Adv. Appl. Prob. 17, 42–52.CrossRefGoogle Scholar
Karlin, S. (1964). Total positivity, absorption probabilities and applications. Trans. Amer. Math. Soc. 111, 33–107.Google Scholar
Karlin, S. (1968). Total Positivity. Stanford University Press, Stanford, CA.Google Scholar
Karlin, S., and McGregor, J. L. (1957). The differential equations of birth-and-death processes, and the Stieltjes moment problem. Trans. Amer. Math. Soc. 85, 489–546.Google Scholar
Karlin, S., and McGregor, J. L. (1959). Characterizations of birth and death processes. Proc. Nat. Acad. Sci. USA 45, 375–379.Google Scholar
Keilson, J. (1971). Log-concavity and log-convexity of passage time densities of diffusion and birth–death processes. J. Appl. Prob. 8, 391–398.Google Scholar
Keilson, J. (1979). Markov Chain Models – Rarity and Exponentiality, Springer, New York.CrossRefGoogle Scholar
Keilson, J., and Kester, A. (1977). Monotone matrices and monotone Markov processes. Stoch. Proc. Appl. 5, 231–241.Google Scholar
Kijima, M. (1987). Spectral structure of the first-passage-time densities for classes of Markov chains. J. Appl. Prob. 24, 631–643.Google Scholar
Kijima, M. (1989). Uniform monotonicity of Markov processes and its related properties. J. Operat. Res. Soc. Japan 32, 475–490.Google Scholar
Kijima, M. (1992). Further monotonicity properties of renewal processes. Adv. Appl. Prob. 24, 575–588.Google Scholar
Kijima, M. (1993). Quasi-limiting distributions of Markov chains that are skip-free to the left in continuous time. J. Appl. Prob. 30, 509–517.Google Scholar
Kijima, M. (1997). Markov Processes for Stochastic Modelling. Chapman & Hall, London.Google Scholar
Li, H., and Shaked, M. (1997). Aging first-passage times. Encyclopedia of Statistical Sciences, Vol. I, eds. Kots, S., Read, C. and Banks, D.L. Wiley, Chichester, pp. 11–20 Google Scholar
Marshall, A. W., and Shaked, M. (1983). New better than used processes. Adv. Appl. Prob. 15, 601–615.CrossRefGoogle Scholar
Shaked, M., and Shanthikumar, J. G. (1988). On the first-passage times of pure jump processes. J. Appl. Prob. 25, 501–509.Google Scholar
Shanthikumar, J. G. (1988). DFR property of first-passage times and its preservation under geometric compounding. Ann. Prob. 16, 397–406.Google Scholar
Stoyan, D. (1983). Comparison Methods for Queues and Other Stochastic Models. Wiley, Chichester.Google Scholar
Sumita, U., and Shanthikumar, J. G. (1986). A software reliability model with multiple-error introduction and removal. IEEE Trans. Reliability 35, 459–462.Google Scholar
van Doorn, E. A. (1980). Stochastic monotonicity of birth–death processes. Adv. Appl. Prob. 12, 59–80.Google Scholar