An inner-outer iteration for computing pagerank

SIAM Journal on Scientific Computing

Volumn 32, Issue 1, 2010, Pages 349-371

  Gleich, David F ^a   Gray, Andrew P ^b   Greif, Chen ^c   Lau, Tracy ^c  

^a Stanford University   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Damping factor; Eigenvalues; Inner outer iterations; Page rank; Power method; Stationary schemes

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; ITERATIVE METHODS; NUMERICAL METHODS;

DAMPING FACTORS; EIGEN-VALUE; INNER-OUTER ITERATIONS; ITERATIVE SCHEMES; PAGE RANKS; POWERS METHOD; SIMPLE++; STATIONARY SCHEME; STORAGE OVERHEAD; SYSTEM FORMULATION;

LINEAR SYSTEMS;

EID: 77249149351     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/080727397     Document Type: Conference Paper

References (46)

1. A. ARASU, J. NOVAK, A. TOMKINS, AND J. TOMLIN, Page Rank Computation and the Structure of the Web: Experiments and Algorithms, in Proceedings of the 11th International Conference on the World Wide Web, Honolulu, 2002, available online from http://www2002.org/CDROM/poster/173.pdf.
2. K. AVRACHENKOV, N. LITVAK, AND K. S. PHAM, Distribution of Page Rank mass among principle components of the web, in Proceedings of the 5th Workshop on Algorithms and Models for the Web Graph, A. Bonato and F. C. Graham, eds., Lecture Notes in Comput. Sci. 4863, Springer-Verlag, 2007, pp. 16-28.
3. M. BAYATI, M. GERRITSEN, D. F. GLEICH, A. SABERI, AND Y. WANG, Matching Wikipedia categories to the Library of Congress subject headings with network alignment, submitted.
4. P. BERKHIN, A survey on PageRank computing, Internet Math., 2 (2005), pp. 73-120.
5. A. BERMAN AND R. PLEMMONS, Nonnegative Matrices in the Mathematical Sciences,revised reprint of the 1979 original, Classics Appl. Math. 9, SIAM, Philadelphia, 1994.
6. M. BIANCHINI, M. GORI, AND F. SCARSELLI, Inside PageRank, ACM Trans. Internet Technol., 5 (2005), pp. 92-128.
7. P. BOLDI, R. POSENATO, M. SANTINI, AND S. VIGNA, Traps and Pitfalls of Topic-Biased PageRank, in Algorithms and Models for the Web-Graph, Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, Heidelberg, 2007.
8. P. BOLDI, M. SANTINI, AND S. VIGNA, PageRank as a function of the damping factor,in Proceedings of the 14th International Conference on the World Wide Web, Chiba, Japan, 2005, pp. 557-566.
9. P. BOLDI AND S. VIGNA, The webgraph framework I: Compression techniques, in Proceedings of the 13th International Conference on the World Wide Web, New York, 2004, pp. 595-602.
10. A. BRAUER, Limits for the characteristic roots of a matrix. IV: Applications to stochastic matrices, Duke Math. J., 19 (1952), pp. 75-91.
11. C. BREZINSKI, M. REDIVO-ZAGLIA, AND S. SERRA-CAPIZZANO, Extrapolation methods for PageRank computations, C. R. Math. Acad. Sci. Paris., 340 (2005), pp. 393-397.
12. K. BRYAN AND T. LEISE, The $25,000,000,000 eigenvector: The linear algebra behind Google, SIAM Rev., 48 (2006), pp. 569-581.
13. G. M. DEL CORSO, A. GULLÍ, AND F. ROMANI, Comparison of Krylov subspace methods on the PageRank problem, J. Comput. Appl. Math., 210 (2007), pp. 159-166. (Pubitemid 47488689)
14. N. EIRON, K. S. MCCURLEY, AND J. A. TOMLIN, Ranking the web frontier, in Proceedings of the 13th International Conference on the World Wide Web, New York, 2004, pp. 309-318.
15. L. ELDÉN, A Note on the Eigenvalues of the Google Matrix, Report LiTH-MAT-R-04-01, Linköping University, Linköping, Sweden, 2003.
16. H. C. ELMAN AND G. H. GOLUB, Inexact and preconditioned Uzawa algorithms for saddle point problems, SIAM J. Numer. Anal., 31 (1994), pp. 1645-1661.
17. E. GILADI, G.H.GOLUB, AND J. B. KELLER, Inner and outer iterations for the Chebyshev algorithm, SIAM J. Numer. Anal., 35 (1998), pp. 300-319.
18. D. GLEICH, L. ZHUKOV, AND P. BERKHIN, Fast Parallel PageRank: A Linear System Approach, Yahoo! Research Technical Report YRL-2004-038, available online from http://research.yahoo.com/publication/YRL-2004-038.pdf, 2004.
19. G. H. GOLUB AND C. GREIF, An Arnoldi-type algorithm for computing PageRank,BIT, 46 (2006), pp. 759-771.
20. G. H. GOLUB AND M. L. OVERTON, The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems, Numer. Math., 53 (1988), pp. 571-593.
21. G. GRIMMETT AND D. STIRZAKER, Probability and Random Processes, 3rd ed., Oxford University Press, Oxford, UK, 2001.
22. Z. GYÖNGYI, H. GARCIA-MOLINA, AND J. PEDERSEN, Combating Web spam with TrustRank, in Proceedings of the 30th International Conference on Very Large Data Bases, Toronto, 2004, pp. 576-587.
23. W. HACKBUSCH, Iterative Solution of Large Sparse Systems of Equations, Springer-Verlag, New York, 1994.
24. I. C. F. IPSEN AND T. M. SELEE, Page Rank computation, with special attention to dangling nodes, SIAM J. Matrix Anal. Appl., 29 (2007), pp. 1281-1296.
25. S. KAMVAR AND T. HAVELIWALA, The Condition Number of the Page Rank Problem,Technical report, Stanford University, Stanford, CA, 2003, available online from http://dbpubs.stanford.edu:8090/pub/2003-36.
26. S. KAMVAR, T. HAVELIWALA, C. MANNING, AND G. GOLUB, Extrapolation methods for accelerating Page Rank computations, in Proceedings of the 12th International Conference on the World Wide Web, Budapest, 2003, pp. 261-270.
27. C. KARANDE, K. CHELLAPILLA, AND R. ANDERSEN, Speeding up algorithms on compressed web graphs, in Proceedings of the 2nd ACM International Conference on Web Search and Data Mining, Barcelona, 2009, pp. 272-281.
28. G. KOLLIAS, E. GALLOPOULOS, AND D. SZYLD, Asynchronous iterative computations with Web information retrieval structures: The Page Rank case, in Parallel Computing: Current and Future Issues of High-End Computing, NIC Ser. 33, John von Neumann Institut fur Computing, Julich, Germany, 2006, pp. 309-316.
29. A. N. LANGVILLE AND C. D. MEYER, A survey of eigenvector methods for Web information retrieval, SIAM Rev., 47 (2005), pp. 135-161.
30. A. LANGVILLE AND C. MEYER, Google's Page Rank and Beyond: The Science of Search Engine Rankings, Princeton University Press, Princeton, NJ, 2006.
31. C. LEE, G. GOLUB, AND S. ZENIOS, A Fast Two-Stage Algorithm for Computing Page Rank and Its Extensions, Technical report SCCM-03-15, Stanford University, Stanford, CA, 2003.
32. F. MCSHERRY, A uniform approach to accelerated Page Rank computation, in Proceedings of the 14th International Conference on the World Wide Web, Chiba, Japan, 2005, pp. 575-582.
33. J. L. MORRISON, R. BREITLING, D. J. HIGHAM, AND D. R. GILBERT, Gene Rank: Using search engine technology for the analysis of microarray experiments, BMC Bioinformatics, 6 (2005), p. 233.
34. M. A. NAJORK, H. ZARAGOZA, AND M. J. TAYLOR, Hits on the web: How does it compare?, in Proceedings of the 30th International ACM SIGIR Conference on Research and Development in Information Retrieval, New York, 2007, pp. 471-478.
35. L. PAGE, S. BRIN, R. MOTWANI, AND T. WINOGRAD, The Page Rank Citation Ranking: Bringing Order to the Web, Stanford Digital Libraries, 1999, available online from http://dbpubs.stanford.edu:8090/pub/1999-66.
36. J. PARREIRA, D. DONATO, S. MICHEL, AND G. WEIKUM, Efficient and decentralized Page Rank approximation in a peer-to-peer web search network, in Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, 2006, pp. 415-426.
37. S. SERRA-CAPIZZANO, Jordan canonical form of the Google matrix: A potential contribution to the Page Rank computation, SIAM J. Matrix Anal. Appl., 27 (2005), pp. 305-312.
38. V. SIMONCINI AND D. B. SZYLD, Theory of inexact Krylov subspace methods and applications to scientific computing, SIAM J. Sci. Comput., 25 (2003), pp. 454-477.
39. R. SINGH, J. XU, AND B. BERGER, Pairwise global alignment of protein interaction networks by matching neighborhood topology, in Research in Computational Molecular Biology, Lecture Notes in Comput. Sci. 4453, Springer-Verlag, Berlin, Heidelberg, pp. 16-31.
40. W. STEWART, Introduction to the Numerical Solution of Markov Chains, Princeton University Press, Princeton, NJ, 1994.
41. The Library of Congress Subject Headings, http://id.loc.gov/authorities/ search/. Accessed via http://lcsh.info, September 2008.
42. R. VARGA, Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1962.
43. S. VIGNA, R. POSENATO, AND M. SANTINI, Law 1.3.1 - Library of Algorithms for the Webgraph, http://law.dsi.unimi.it/software/docs/.
44. Wikipedia XML Database Dump from April 2, 2007. Accessed from http://en.wikipedia.org/wiki/Wikipedia:Database-download, April 2007.
45. R. S. WILLS AND I. C. F. IPSEN, Ordinal ranking for Google's Page Rank,SIAM J. Matrix Anal. Appl., 30 (2009), pp. 1677-1696.
46. D. ZHOU, J. HUANG, AND SCHÖLKOPF, Learning from labeled and unlabeled data on a directed graph, in Proceedings of the 22nd International Conference on Machine Learning, Bonn, Germany, 2005, pp. 1036-1043.