Lumpability and Absorbing Markov Chains
We consider an absorbing Markov Chain that a result of an aggregation finite Markov Chain of higher dimension with respect to the partition and unknown transition probability matrix (t.p.m), the question of whether is(not) also absorbing will be study for the lumped and the weakly lumped absorbing Markov Chain for all (certain) partitions within isomorphic with respect to the cases (k, k+1) and (2, k). Special cases will be introduced for each case, for each partition.
Absorbing Markov Chains – Aggregation of States – Identifiability Problem –Lumpability – Isomorphic
Ahmed A.El-Sheikh, Aham103@yahoo.com
READING THE ARTICLE: You can read the article in
portable document (.pdf) format (157312 bytes.)
NOTE: The content of this article is the intellectual property of the authors, who retains all rights to future publication.
This page has been accessed 2241 times since JUNE 3, 2008.
Return to the Home Page.