Updating pagerank with iterative aggregation
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
SIAM Journal on Matrix Analysis and Applications
A Reordering for the PageRank Problem
SIAM Journal on Scientific Computing
Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer
SIAM Journal on Matrix Analysis and Applications
Google's PageRank and Beyond: The Science of Search Engine Rankings
Google's PageRank and Beyond: The Science of Search Engine Rankings
PageRank Computation, with Special Attention to Dangling Nodes
SIAM Journal on Matrix Analysis and Applications
Journal of Computational and Applied Mathematics
Comments on "Jordan Canonical Form of the Google Matrix"
SIAM Journal on Matrix Analysis and Applications
PageRank: Splitting Homogeneous Singular Linear Systems of Index One
ICTIR '09 Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory
Arnoldi versus GMRES for computing pageRank: A theoretical contribution to google's pageRank problem
ACM Transactions on Information Systems (TOIS)
An Arnoldi-Extrapolation algorithm for computing PageRank
Journal of Computational and Applied Mathematics
Dynamic models of informational control in social networks
Automation and Remote Control
Journal of Biomedical Informatics
Hi-index | 7.29 |
Computing Google's PageRank via lumping the Google matrix was recently analyzed in [I.C.F. Ipsen, T.M. Selee, PageRank computation, with special attention to dangling nodes, SIAM J. Matrix Anal. Appl. 29 (2007) 1281-1296]. It was shown that all of the dangling nodes can be lumped into a single node and the PageRank could be obtained by applying the power method to the reduced matrix. Furthermore, the stochastic reduced matrix had the same nonzero eigenvalues as the full Google matrix and the power method applied to the reduced matrix had the same convergence rate as that of the power method applied to the full matrix. Therefore, a large amount of operations could be saved for computing the full PageRank vector. In this note, we show that the reduced matrix obtained by lumping the dangling nodes can be further reduced by lumping a class of nondangling nodes, called weakly nondangling nodes, to another single node, and the further reduced matrix is also stochastic with the same nonzero eigenvalues as the Google matrix.