×

Multilevel adaptive aggregation for Markov chains, with application to web ranking. (English) Zbl 1173.65028

Summary: A multilevel adaptive aggregation method for calculating the stationary probability vector of an irreducible stochastic matrix is described. The method is a special case of the adaptive smoothed aggregation and adaptive algebraic multigrid methods for sparse linear systems and is also closely related to certain extensively studied iterative aggregation/disaggregation methods for Markov chains.
In contrast to most existing approaches, our aggregation process does not employ any explicit advance knowledge of the topology of the Markov chain. Instead, adaptive agglomeration is proposed that is based on the strength of connection in a scaled problem matrix, in which the columns of the original problem matrix at each recursive fine level are scaled with the current probability vector iterate at that level. The strength of connection is determined as in the algebraic multigrid method, and the aggregation process is fully adaptive, with optimized aggregates chosen in each step of the iteration and at all recursive levels.
The multilevel method is applied to a set of stochastic matrices that provide models for web page ranking. Numerical tests serve to illustrate for which types of stochastic matrices the multilevel adaptive method may provide significant speedup compared to standard iterative methods. The tests also provide more insight into why Google’s PageRank model is a successful model for determining a ranking of web pages.

MSC:

65F15 Numerical computation of eigenvalues and eigenvectors of matrices
65C40 Numerical analysis or methods applied to Markov chains
60J22 Computational methods in Markov chains
65F10 Iterative numerical methods for linear systems
15B51 Stochastic matrices
65F50 Computational methods for sparse matrices
68P10 Searching and sorting
PDFBibTeX XMLCite
Full Text: DOI