A Deeper Investigation of PageRank as a Function of the Damping Factor

Dagstuhl Seminar Proceedings

Volumn 7071, Issue , 2007, Pages

  Boldi, Paolo ^a   Santini, Massimo ^a   Vigna, Sebastiano ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DAMPING; ITERATIVE METHODS; MARKOV PROCESSES; POLYNOMIAL APPROXIMATION;

CLOSED-FORM FORMULAE; DAMPING FACTORS; MATHEMATICAL ANALYSIS; PAGE RANKS; PAGERANK VALUE; POWERS METHOD; REAL-WORLD GRAPHS; STATIONARY STATE; TRANSITION MATRICES; WEB GRAPHS;

MATHEMATICAL OPERATORS;

EID: 85174615677     PISSN: 18624405     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. Konstantin Avrachenkov, Nelly Litvak, and Kim Son Pham. A singular perturbation approach for choosing PageRank damping factor, 2006.
2. Ricardo Baeza-Yates, Paolo Boldi, and Carlos Castillo. Generalizing PageRank: damping functions for link-based ranking algorithms. In SIGIR '06: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, pages 308-315, New York, NY, USA, 2006. ACM Press.
3. Paolo Boldi, Bruno Codenotti, Massimo Santini, and Sebastiano Vigna. Ubicrawler: A scalable fully distributed web crawler. Software: Practice & Experience, 34(8):711-726, 2004.
4. Paolo Boldi, Violetta Lonati, Massimo Santini, and Sebastiano Vigna. Graph fibrations, graph isomorphism, and PageRank. RAIRO Inform. Théor., 40:227-253, 2006.
5. Paolo Boldi, Roberto Posenato, Massimo Santini, and Sebastiano Vigna. Traps and pitfalls of topic-biased PageRank. In WAW 2006. Fourth Workshop on Algorithms and Models for the Web-Graph, Lecture Notes in Computer Science. Springer-Verlag, 2007.
6. Paolo Boldi, Massimo Santini, and Sebastiano Vigna. PageRank as a function of the damping factor. In Proc. of the Fourteenth International World Wide Web Conference, pages 557-566, Chiba, Japan, 2005. ACM Press.
7. Paolo Boldi and Sebastiano Vigna. The WebGraph framework I: Compression techniques. In Proc. of the Thirteenth International World Wide Web Conference, pages 595-601, Manhattan, USA, 2004. ACM Press.
8. Michael Brinkmeier. PageRank revisited. ACM Transactions on Internet Technology (TOIT), 6(3):282-301, 2006.
9. Gianna Del Corso, Antonio Gullì, and Francesco Romani. Fast PageRank computation via a sparse linear system. Internet Math., 2(3), 2006.
10. Nadav Eiron, Kevin S. McCurley, and John A. Tomlin. Ranking the web frontier. In Proceedings of the thirteenth international conference on World-Wide Web, pages 309-318. ACM Press, 2004.
11. Gene H. Golub and Chen Greif. Arnoldi-type algorithms for computing stationary distribution vectors, with application to PageRank. Technical Report SCCM-04-15, Stanford University Technical Report, 2004.
12. Taher Haveliwala and Sepandar Kamvar. The condition number of the PageRank problem. Technical Report 36, Stanford University Technical Report, June 2003.
13. Taher H. Haveliwala. Efficient computation of PageRank. Technical Report 31, Stanford University Technical Report, October 1999. Available at http://dbpubs.stanford.edu/pub/1999-31.
14. Taher H. Haveliwala and Sepandar D. Kamvar. The second eigenvalue of the Google matrix. Technical Report 20, Stanford University Technical Report, March 2003. Available at http://dbpubs.stanford.edu/pub/2003-20.
15. Marius Iosifescu. Finite Markov Processes and Their Applications. John Wiley & Sons, 1980.
16. Glen Jeh and Jennifer Widom. Scaling personalized web search. In WWW '03: Proceedings of the 12th international conference on World Wide Web, pages 271-279, New York, NY, USA, 2003. ACM Press.
17. Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning, and Gene H. Golub. Exploiting the block structure of the web for computing PageRank. Technical Report 17, Stanford University Technical Report, March 2003. Available at http://dbpubs.stanford.edu/pub/2003-17.
18. Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning, and Gene H. Golub. Extrapolation methods for accelerating PageRank computations. In Proceedings of the twelfth international conference on World Wide Web, pages 261-270. ACM Press, 2003.
19. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tompkins, and Eli Upfal. The Web as a graph. In PODS '00: Proceedings of the nineteenth ACM SIGMODSIGACT-SIGART symposium on Principles of database systems, pages 1-10. ACM Press, 2000.
20. Amy N. Langville and Carl D. Meyer. Deeper inside PageRank. Internet Mathematics, 1(3):355-400, 2004.
21. Chris Pan-Chi Lee, Gene H. Golub, and Stefanos A. Zenios. A fast twostage algorithm for computing PageRank and its extensions. Technical Report SCCM-03-15, Stanford University Technical Report, 2003. Available at http://www-sccm.stanford.edu/pub/sccm/sccm03-15-2.pdf.
22. Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The PageRank citation ranking: Bringing order to the web. Technical Report 66, Stanford University, 1999. Available at http://dbpubs.stanford.edu/pub/1999-66.
23. Luca Pretto. A theoretical analysis of google's PageRank. In Proceedings of the Ninth Symposium on String Processing and Information Retrieval, pages 131-144, 2002.
24. Luca Pretto. A theoretical approach to link analysis algorithms, 2002. PhD Thesis.
25. Stefano Serra-Capizzano. Jordan canonical form of the Google matrix: A potential contribution to the PageRank computation. SIAM Journal on Matrix Analysis and Applications, 27(2):305-312, 2005.
26. Sebastiano Vigna. TruRank: Taking PageRank to the limit. In Fourteenth International World Wide Web Conference (WWW 2005), Special Interest Tracks & Posters, pages 976-977, Chiba, Japan, 2005. ACM Press.