An Aggregation/Disaggregation Algorithm for Computing the Stationary Distribution of a Large Markov Chain

Moshe Haviv*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

A new aggregation/disaggregation iterative procedure for computing the stationary distribution of a large Markov chain is proposed. In each iteration two steps are performed. In the first, one updates approximations to the limit of the conditional probabilities of states given the subset which the chain visits. This is done by rank-one modifications of stochastic matrices each of which approximates the transition probabilities of the Markov chain resulting from observing the original chain only while in the subset under consideration. This results in a computational improvement upon existing methods in which the modification is not rank-one. In the second step, one approximates the aggregate probabilities of the subsets themselves. We analyse the performance of the procedure when applied to nearly uncoupled stochastic matrices. In particular, we show that if the matrix has the degree of coupling ε between subsets, then there is a reduction of O(ε) in the error of the approximation at each iteration.

Original languageEnglish
Pages (from-to)565-575
Number of pages11
JournalCommunications in Statistics. Part C: Stochastic Models
Volume8
Issue number3
DOIs
StatePublished - 1992
Externally publishedYes

Fingerprint

Dive into the research topics of 'An Aggregation/Disaggregation Algorithm for Computing the Stationary Distribution of a Large Markov Chain'. Together they form a unique fingerprint.

Cite this