Abstract
The stochastic modification and irreducible modification in PageRank produce large web link changes correspondingly. To get a minimal irreducible web link adjustment, a PageRank model of minimal irreducible adjustment and its lumping method are discussed by Li, Chen, and Song. In this paper, we provide alternative proofs for the minimal irreducible PageRank by a new type of similarity transformation matrices. To further provide theorems and fast algorithms on a reduced matrix, an 4×4 block matrix partition case of the minimal irreducible PageRank model is utilized and analyzed. For some real applications of our results, a lumping algorithm used for speeding up PageRank vector computations is also presented. Numerical results are also reported to show the efficiency of the proposed algorithm.
Funder
National Natural Science Foundation of China
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference27 articles.
1. The PageRank Citation Ranking: Bringing Order to the Web; Stanford Digital Libraries: 1999http://dbpubs.stanford.edu:8090/pub/1999–66
2. An Extrapolation Iteration and Its Lumped Type Iteration for Computing PageRank
3. Google’s PageRank and Beyond: The Science of Search Engine Rankings;Langville,2006
4. The PageRank Vector: Properties, Computation, Approximation, and Acceleration
5. The power method and beyond