A singular perturbation approach for choosing the pagerank damping factor

Internet Mathematics

Volumn 5, Issue 1-2, 2008, Pages 47-69

  Avrachenkov, Konstantin ^a   Litvak, Nelly ^b   Pham, Kim Son ^c  

^a INRIA   (France)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c ST PETERSBURG STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77953351944     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2008.10129300     Document Type: Article

References (23)

1. K. Avrachenkov. “Analytic Perturbation Theory and Its Applications.” PhD thesis, University of South Australia, 1999.
2. K. Avrachenkov and N. Litvak. “The Effect of New Links on Google PageRank.” Stoch. Models 22:2 (2006), 319–331.
3. K. Avrachenkov, M. Haviv, and P. Howlett. “Inversion of Analytic Matrix Functions That Are Singular at the Origin.” SIAM Journal on Matrix Analysis and Applications 22:4 (2001), 1175–1189.
4. K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova. “Monte Carlo Methods in PageRank Computation: When One Iteration Is Sufficient.” SIAM J. Numer. Anal. 45:2 (2007), 890–904.
5. P. Berkhin. “A Survey on PageRank Computing.” Internet Math. 2 (2005), 73–120.
6. M. Bianchini, M. Gori, and F. Scarselli. “Inside PageRank.” ACM Trans. Inter. Tech. 5:1 (2005), 92–128.
7. P. Boldi, M. Santini, and S. Vigna. “PageRank as a Function of the Damping Factor.” In Proc. of the Fourteenth International World Wide Web Conference, Chiba, Japan. New York: ACM Press, 2005.
8. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Statac, A. Tomkins, and J. Wiener. “Graph Structure in the Web.” Computer Networks 33 (2000), 309–320.
9. P. Chen, H. Xie, S. Maslov, and S. Redner. “Finding Scientific Gems with Google’s PageRank Algorithm.” Journal of Informatics 1:1 (2007), 8–15.
10. S. Dill, R. Kumar, K. S. Mccurley, S. Rajagopalan, D. Sivakumar, and A. Tomkins. “Self-Similarity in the Web.” ACM Trans. Inter. Tech. 2:3 (2002), 205–223.
11. N. Eiron, K. McCurley, and J. Tomlin. “Ranking the Web Frontier.” In Proceedings of the 13th International Conference on the World Wide Web, pp. 309–318. New York: ACM Press, 2004.
12. S. Fortunato, and A. Flammini. “Random Walks on Directed Networks: The Case of PageRank.” International Journal of Bifurcation and Chaos 17:7 (2007), 2343–2353.
13. J. M. Kleinberg. “Authoritative Sources in a Hyperlinked Environment.” Journal of the ACM 46:5 (1999), 604–632.
14. V. S. Korolyuk and A. F. Turbin. Mathematical Foundations of the State Lumping of Large Systems, Mathematics and Its Applications 264. Dordrecht: Kluwer, 1993.
15. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. “The Web as a Graph.” In Proceedings of the 19th ACM SIGACTSIGMOD- AIGART Symposium on Principles of Database Systems, pp. 1–10. New York: ACM Press, 2000.
16. A. N. Langville and C. D. Meyer. “Deeper inside PageRank.” Internet Math. 1 (2003), 335–380.
17. A. N. Langville and C. D. Meyer. Google’s PageRank and Beyond: The Science of Search Engine Rankings. Princeton: Princeton University Press, 2006.
18. R. Lempel and S. Moran. “The Stochastic Approach for Link- Structure Analysis (SALSA) and the TKC Effect.” Comput. Networks 33:1–6 (2000), 387–401.
19. C. Moler, and K. Moler. Numerical Computing with MATLAB. Philadelphia: SIAM, 2003.
20. L. Page, S. Brin, R. Motwani, and T. Winograd. “The PageRank Citation Ranking: Bringing Order to the Web.” Technical report, Stanford University, 1998.
21. A. A. Pervozvanskii and V. G. Gaitsgori. Theory of Suboptimal Decisions, Mathematics and Its Applications (Soviet Series) 12. Dordrecht: Kluwer, 1988.
22. E. Seneta. Non-negative Matrices and Markov Chains, Springer Series in Statistics; revised reprint of the second (1981) edition. New York: Springer, 2006.
23. G. G. Yin and Q. Zhang. Discrete-Time Markov Chains. Applications of Mathematics (New York) 55. New York: Springer, 2005.