Abstract
A new aggregation algorithm for computing the stationary distribution of a large Markov chain is proposed. This algorithm is attractive when the state space of Markov chain is large enough so that the direct and iterative methods are inefficient. It is based on grouping the states of a Markov chain in such a way that the probability of changing the state inside the group is of greater order of magnitude than interactions between groups. The correctness of the combinatorial aggregation is justified by the method of forest expansions developed recently in [5,6]. In contrast to existing methods our approach is based on combinatorial and graph-theoretic framework and can be seen as an algorithmization of famous Markov Chain Tree Theorem. The general method is illustrated by an example of computing the stationary distribution. We establish also some preliminary results on the complexity of our algorithm. Numerical experiments on several benchmark examples show the potential applicability of the algorithm in real life problems.
This work was partially supported by the KBN grant 8 T11C 039 15
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Courtois, P. J.: Decomposability: Queueing and Computer System Applications, Academic Press, New York, 1977.
Dayar, T. and Stewart, W.J.: On the effects of using the Grassman-Taksar-Heyman method in iterative aggregation-disaggregation, SIAM Journal on Scientific Computing, vol. 17, 1996, pp. 287–303.
Kafeety, D.D., Meyer, C.D. and Stewart, W.J.: A General Framework for Iterative Aggregation/Disaggregation Methods, Proceedings of the Fourth Copper Mountain Conference on Iterative Methods, 1992.
Kemeny, J.G. and Snell, J.L.: Finite Markov Chains. Van Nostrand, Princeton, 1960.
Pokarowski, P. Directed forests and algorithms related to Markov chains, PhD thesis Institute of Mathematics, Polish Academy of Sciences, 1998.
Pokarowski, P. Directed forests with applications to algorithms related to Markov chains, Applicationes Mathematicae, vol. 26, no. 4, 1999, pp. 395–414.
Stewart, W. J.: Introduction to the numerical solution of Markov chains, Princeton University Press, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gambin, A., Pokarowski, P. (2001). A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_38
Download citation
DOI: https://doi.org/10.1007/3-540-44669-9_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42487-1
Online ISBN: 978-3-540-44669-9
eBook Packages: Springer Book Archive