Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-25T16:08:44.840Z Has data issue: false hasContentIssue false

Lumpability for non-irreducible finite markov chains

Published online by Cambridge University Press:  14 July 2016

Atef M. Abdel-Moneim*
Affiliation:
Cairo University
Frederick W. Leysieffer*
Affiliation:
The Florida State University
*
Postal address: West Heliopolis Post Office, 8 Ahmed Abdel Salam Zaki Street, Apartment #5, Cairo, Egypt.
∗∗Postal address: Department of Statistics and Statistical Consulting Center, The Florida State University, Tallahassee, FL 32306, U.S.A.

Abstract

Conditions under which a function of a finite, discrete-time Markov chain, X(t), is again Markov are given, when X(t) is not irreducible. These conditions are given in terms of an interrelationship between two partitions of the state space of X(t), the partition induced by the minimal essential classes of X(t) and the partition with respect to which lumping is to be considered.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1984 

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

[1] Burke, C. J. and Rosenblatt, M. (1958) A Markovian function of a finite Markov chain. Ann. Math. Statist. 29, 11121122.Google Scholar
[2] Chung, Kai Lai (1967) Markov Chains, 2nd edn. Springer-Verlag, New York.Google Scholar
[3] Hachigian, J. and Rosenblatt, M. (1963) Collapsed Markov chains and the Chapman–Kolmogorov equation. Ann. Math. Statist. 34, 233237.CrossRefGoogle Scholar
[4] Kemeny, J. G. and Snell, J. L. (1978) Finite Markov Chains, 2nd edn. Springer-Verlag, New York.Google Scholar
[5] Leysieffer, F. W. (1967) Functions of finite Markov chains. Ann. Math. Statist. 38, 206212.Google Scholar