Abstract
If a system is modeled by a finite Markov chain which is ergodic, the passage time from some specified initial distribution over the state space to a subset B of the state space visited infrequently is often exponentially distributed to good approximation. The chapter is devoted to the limit theorems surrounding such behavior for processes and the characterization of thè circumstances under which exponentiality is present. In the absence of certain “jitter,” i.e., clustering of the entry epochs into the good set G, the time to failure from the perfect state, the quasi-stationary exit time, the ergodic exit time and the sojourn time on the good set then have a common asymptotic exponential distribution and common expectations. For engineering purposes, it is essential to quantify departure from exponentiality via error bounds. When one is dealing with time-reversible chains e.g., systems with independent Markov components, the complete monotonicity present permits such quantification and the error bounds needed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1979 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Keilson, J. (1979). Rarity and Exponentiality. In: Keilson, J. (eds) Markov Chain Models — Rarity and Exponentiality. Applied Mathematical Sciences, vol 28. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-6200-8_9
Download citation
DOI: https://doi.org/10.1007/978-1-4612-6200-8_9
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-90405-4
Online ISBN: 978-1-4612-6200-8
eBook Packages: Springer Book Archive