Skip to main content
Conference Proceedings

Iterative aggregation/disaggregation methods for computing some characteristics of Markov chains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2179 68-80
DOI: 10.1007/3-540-45346-6_6
3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A class of iterative aggregation/disaggregation methods(IAD) for computation some important characteristics of Markov chainssuch as stationary probability vectors and mean first passage times matricesis presented and convergence properties of the corresponding algorithmsare analyzed.

Cite

CITATION STYLE

APA

Marek, I., & Mayer, P. (2001). Iterative aggregation/disaggregation methods for computing some characteristics of Markov chains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2179, pp. 68–80). Springer Verlag. https://doi.org/10.1007/3-540-45346-6_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free