Inexact and preconditioned Uzawa algorithms for saddle point problems
SIAM Journal on Numerical Analysis - Special issue: the articles in this issue are dedicated to Seymour V. Parter
Inner and Outer Iterations for the Chebyshev Algorithm
SIAM Journal on Numerical Analysis
Extrapolation methods for accelerating PageRank computations
WWW '03 Proceedings of the 12th international conference on World Wide Web
Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
SIAM Journal on Scientific Computing
Proceedings of the 13th international conference on World Wide Web
The webgraph framework I: compression techniques
Proceedings of the 13th international conference on World Wide Web
ACM Transactions on Internet Technology (TOIT)
PageRank as a function of the damping factor
WWW '05 Proceedings of the 14th international conference on World Wide Web
A uniform approach to accelerated PageRank computation
WWW '05 Proceedings of the 14th international conference on World Wide Web
Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
SIAM Journal on Matrix Analysis and Applications
Learning from labeled and unlabeled data on a directed graph
ICML '05 Proceedings of the 22nd international conference on Machine learning
Google's PageRank and Beyond: The Science of Search Engine Rankings
Google's PageRank and Beyond: The Science of Search Engine Rankings
Efficient and decentralized PageRank approximation in a peer-to-peer web search network
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Hits on the web: how does it compare?
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Comparison of Krylov subspace methods on the PageRank problem
Journal of Computational and Applied Mathematics
Combating web spam with trustrank
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
PageRank Computation, with Special Attention to Dangling Nodes
SIAM Journal on Matrix Analysis and Applications
Traps and Pitfalls of Topic-Biased PageRank
Algorithms and Models for the Web-Graph
Speeding up algorithms on compressed web graphs
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Ordinal Ranking for Google's PageRank
SIAM Journal on Matrix Analysis and Applications
Pairwise global alignment of protein interaction networks by matching neighborhood topology
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Distribution of PageRank mass among principle components of the web
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
| Hi-index | 0.00 |
We present a new iterative scheme for PageRank computation. The algorithm is applied to the linear system formulation of the problem, using inner-outer stationary iterations. It is simple, can be easily implemented and parallelized, and requires minimal storage overhead. Our convergence analysis shows that the algorithm is effective for a crude inner tolerance and is not sensitive to the choice of the parameters involved. The same idea can be used as a preconditioning technique for nonstationary schemes. Numerical examples featuring matrices of dimensions exceeding 100,000,000 in sequential and parallel environments demonstrate the merits of our technique. Our code is available online for viewing and testing, along with several large scale examples.