On computing PageRank via lumping the Google matrix

Journal of Computational and Applied Mathematics

Volumn 224, Issue 2, 2009, Pages 702-708

  Lin, Yiqin ^a   Shi, Xinghua ^b   Wei, Yimin ^b  

^a HUNAN UNIVERSITY OF SCIENCE AND ENGINEERING   (China)

^b FUDAN UNIVERSITY   (China)

Author keywords

Dangling node; Google matrix; Lumping; PageRank; Power method; Weakly nondangling node

Indexed keywords

DANGLING NODE; GOOGLE MATRIX; LUMPING; PAGERANK; POWER METHOD; WEAKLY NONDANGLING NODE;

INTERNET;

EID: 58149347777     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2008.06.003     Document Type: Article

References (20)

1. Berkhin P. A survey on PageRank computing. Internet Math. 2 (2005) 73-120
2. Brezinski C., Redivo-Zaglia M., and Serra-Capizzano S. Extrapolation methods for PageRank computations. C. R. Acad. Sci. Paris, Ser. I 340 (2005) 393-397
3. Golub G.H., and Grief C. Arnoldi-type algorithms for computing stationary distribution vectors with application to PageRank. BIT 46 (2006) 759-771
4. T.H. Haveliwala, S.D. Kamvar, D. Klein, C. Manning, G.H. Golub, Computing PageRank using power extrapolation, Stanford University Technical Report, July 2003
5. T.H. Haveliwala, S.D. Kamvar, The second eigenvalue of the Google matrix, Stanford University Technical Report, 2003
6. Ipsen I.C.F., and Selee T.M. PageRank computation, with special attention to dangling nodes. SIAM J. Matrix Anal. Appl. 29 (2007) 1281-1296
7. Ipsen I.C.F., and Kirkland S. Convergence analysis of a PageRank updating algorithm by Langville and Meyer. SIAM J. Matrix Anal. Appl. 27 (2006) 952-967
8. S.D. Kamvar, T.H. Haveliwala, C.D. Manning, G.H. Golub, Exploiting the block structure of the web for computing PageRank, Technical Report, Stanford University, Stanford, CA, 2003
9. Kamvar S.D., Haveliwala T.H., and Golub G.H. Adaptive methods for the computation of PageRank. Linear Algebra Appl. 386 (2004) 51-65
10. S.D. Kamvar, T.H. Haveliwala, G.H. Golub, Extrapolation methods for accelerating PageRank computations, Technique Report SCCM 03-02, Stanford University, 2003
11. Langville A.N., and Meyer C.D. A reordering for the PageRank problem. SIAM J. Sci. Comput. 27 (2006) 2112-2120
12. Langville A.N., and Meyer C.D. Updating PageRank with iterative aggregation. Proceedings of the Thirteenth World Wide Web Conference (2004), ACM Press, New York 392-393
13. Langville A.N., and Meyer C.D. Deeper inside PageRank. Internet Math. 1 (2005) 335-400
14. Langville A.N., and Meyer C.D. Google's PageRank and Beyond: The Science of Search Engine Rankings (2006), Princeton University Press, Princeton, NJ
15. C.P. Lee, G.H. Golub, S.A. Zenios, A fast two-stage algorithm for computing PageRank and its extensions, Stanford University Technical Report, SCCM-03-15, 2003
16. L. Page, S. Brin, R. Motwani, T. Winograd, The PageRank citation ranking: Bring order to the web, Stanford Digital Libraries Working Paper, 1998
17. Serra-Capizzano S. Jordan canonical form of the Google matrix: A potential contribution to the PageRank computation. SIAM J. Matrix Anal. Appl. 27 (2005) 305-312
18. Wu G., and Wei Y. A power-Arnoldi algorithm for computing PageRank. Numer. Linear Algebra Appl. 14 (2007) 521-546
19. Wu G., and Wei Y. Comments on "Jordan canonical form of the Google matrix". SIAM J. Matrix Anal. Appl. 30 (2008) 364-374
20. Wu G. Eigenvalues and Jordan canonical form of a successively rank-one updated complex matrix with applications to Google's PageRank problem. J. Comput. Appl. Math. 216 (2008) 364-370