Fast PageRank computation via a sparse linear system

Internet Mathematics

Volumn 2, Issue 3, 2005, Pages 251-273

  Del Corso, Gianna M ^a   Gullí, Antonio ^a   Romani, Francesco ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84924205346     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2005.10129108     Document Type: Article

References (26)

1. A. Arasu, J. Novak, A. Tomkins, and J. Tomlin. “PageRank Computation and the Structure of the Web: Experiments and Algorithms.” In The Eleventh International World Wide Web Conference Poster Proceedings. Available from World Wide Web (http://www.ra.ethz.ch/CDstore/www2002/poster/173.pdf), 2002.
2. M. Bianchini, M. Gori, and F. Scarselli. “Inside PageRank.” ACM Trans. on Internet Technology 5 (2004), 92–128.
3. P. Boldi and S. Vigna. “WebGraph Framework I: Compression Techniques.” In Proceedings of the 13th International Conference on World Wide Web, pp. 595–602. New York: ACM Press, 2004.
4. S. Brin and L. Page. “The Anatomy of a Large-Scale Hypertextual Web Search Engine.” Computer Networks and ISDN Systems 30:1–7 (1998), 107–117.
5. A. Z. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. L. Wiener. “Graph Structure in theWeb.” Computer Networks 33 (2000), 309–320.
6. A. L. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. Westbrook. “On External Memory Graph Traversal.” In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 859–860. Philadelphia: SIAM, 2000.
7. Y. Chen, Q. Gan, and T. Suel. “I/O-efficient Techniques for Computing PageRank.” In Proceedings of the Eleventh International Conference on Information and Knowledge Management, pp. 549–557. New York: ACM Press, 2002.
8. J. Cho and S. Roy. “Impact of Web search engines on page popularity.” In Proceedings of the 13th International Conference on World Wide Web, pp. 20–29. New York: ACM Press, 2004.
9. E. Cuthill and J. McKee. “Reducing the Bandwidth of Sparse Symmetric Matrices.” In Proceedings of the 1969 24th National Conference, pp. 157–172. New York: ACM Press, 1969.
10. C. Douglas, J. Hu, M. Iskandarani, M. Kowarschik, U. Rüde, and C. Weiss. “Maximizing Cache Memory Usage for Multigrid Algorithms.” In Multiphase Flows and Transport in Porous Media: State of the Art, edited by Z. Chen et al., pp. 124–137. Lecture Notes in Physics 552. Berlin: Springer, 2000.
11. N. Eiron, S. McCurley, and J. A. Tomlin. “Ranking theWeb Frontier.” In Proceedings of the 13th International Conference on World Wide Web, pp. 390–318. New York: ACM Press, 2004.
12. G. H. Golub and C. F. Van Loan. Matrix Computations, Third Edition. Baltimore: The John Hopkins University Press, 1996.
13. T. Haveliwala. “Efficient Computation of PageRank.” Technical report, Stanford University, 1999.
14. T. Haveliwala. “Topic-Sensitive PageRank.” In Proceedings of the 11th International Conference on World Wide Web, pp. 517–526. New York: ACM Press, 2002.
15. T. Haveliwala, S. Kamvar, and G. Jeh. “An Analytical Comparison of Approaches to Personalizing PageRank.” Technical report, Stanford University, 2003.
16. G. Jeh and J. Widom. “Scaling Personalized Web Search.” In Proceedings of the 12th International Conference on World Wide Web, pp. 271–279. New York: ACM Press, 2003.
17. S. Kamvar and T. Haveliwala. “The Condition Number of the PageRank Problem.” Technical report, Stanford University, 2003.
18. S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. “Extrapolation Methods for Accelerating PageRank Computations.” In Proceedings of the 12th International Conference on World Wide Web, pp. 261–270. New York: ACM Press, 2003.
19. S. D. Kamvar, T. H. Haveliwala, C. Manning, and G. H. Golub. “Exploiting the Block Structure of the Web for Computing PageRank.” Technical report, Stanford University, 2003.
20. A. N. Langville and C. D. Meyer. “Deeper Inside PageRank.” Internet Mathematics 1:3 (2004), 335–400.
21. C. P. Lee, G. H. Golub, and S. A. Zenios. “A Fast Two-Stage Algorithm for Computing PageRank.” Technical report, Stanford University, 2003.
22. K. Mehlhorn and U. Meyer. “External-Memory Breadthfirst Search with Sublinear I/O.” In Algorithms–ESA 2002: 10th Annual European Symposium, Rome, Italy, September 17–21, 2002, Proceedings, pp. 723–735. Lecture Notes in Computer Science 2461. Berlin: Springer, 2002.
23. L. Page, S. Brin, R. Motwani, and T. Winograd. “The PageRank Citation Ranking: Bringing Order to the Web.” Technical report, Stanford University, 1998.
24. W. S. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton, NJ: Princeton University Press, 1995.
25. R. S. Varga. Matrix Iterative Analysis. Englewood Cliffs, NJ: Prentice-Hall, 1962.
26. H. Zhang and A. Goel and R. Govindan and K. Mason and B. Van Roy. “Making Eigenvector-Based Reputation System Robust to Collusion.” In Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004, Proceedings, pp. 92–104. Lecture Notes in Computer Science 3243. Berlin: Springer, 2004.