Pagerank of Scale-Free Growing Networks

Internet Mathematics

Volumn 3, Issue 2, 2006, Pages 207-231

  Avrachenkov, Konstantin ^a   Lebedev, Dmitri ^b  

^a INRIA   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38149128761     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2006.10129120     Document Type: Article

References (24)

1. A.-L. Barabási and R. Albert. “Emergence of Scaling in Random Networks.” Science 286 (1999), 509–512.
2. A.-L. Barabási, R. Albert, and H. Jeong. “Mean-Field Theory for Scale-Free Random Networks.” Physica A 272 (1999), 173–187.
3. A.-L. Barabási, R. Albert, and H. Jeong. “Scale-Free Characteristics of Random Networks: The Topology of the World Wide Web.” Physica A 281 (2000), 69–77.
4. M. Bianchini, M. Gori, and F. Scarselli. “Inside PageRank.” ACM Trans. Internet Technology 5:1 (2005), 92–128.
5. P. Boldi, M. Santini, and S. Vigna. “PageRank as a Function of the Damping Factor.” In Proceedings of the 14th International Conference on World Wide Web, pp. 557–566. New York: ACM Press, 2005.
6. B. Bollobás and O. Riordan. “Mathematical Results in Scale-Free Random Graphs.” In Handbook of Graphs and Networks, edited by S. Bornholdt and H. G. Schuster, pp. 1–34. Weinheim: Wiley-VCH, 2002.
7. B. Bollobás and O. Riordan. “The Diameter of a Scale-Free Random Graph.” Combinatorica 24:1 (2004), 5–34.
8. B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády. “The Degree Sequence of a Scale-Free Random Graph Process.” Random Structures and Algorithms 18:3 (2001), 279–290.
9. A. A. Borovkov. Probability Theory. New York: Gordon and Breach Science Publishers, 1998.
10. S. Brin and L. Page. “The Anatomy of a Large-Scale Hypertextual Web Search Engine.” Computer Networks 30:1–7 (1998), 107–117.
11. S. N. Dorogovtsev and J. F. F. Mendes. “Evolution of Networks.” Advances in Physics 51 (2002), 1079–1187.
12. S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin. “Structure of Growing Networks with Preferential Linking.” Phys. Rev. Lett. 85 (2000), 4633–4636.
13. N. L. Johnson and S. Kotz. Urn Models and Their Application. New York: John Wiley and Sons, 1977.
14. J. Kleinberg. “Authoritative Sources in a Hyperlinked Environment.” Journal of the ACM 46:5 (1999), 604–632.
15. A. N. Langville and C. D. Meyer. “Deeper Inside PageRank.” Internet Mathematics 1:3 (2005), 335–380.
16. A. N. Langville and C. D. Meyer. Google’s PageRank and Beyond: The Science of Search Engine Rankings. Princeton, NJ: Princeton University Press, 2006.
17. R. Lempel and S. Moran. “The Stochastic Approach for Link-Structure Analysis (SALSA) and the TKC Effect.” In Proceedings of the Ninth International World Wide Web Conference. Available at http://www9.org/ w9cdrom/175/175.html, 2000.
18. C. B. Moler. Numerical Computing with MATLAB. Philadelphia: SIAM, 2004.
19. M. E. J. Newman. “The Structure and Function of Complex Networks.” SIAM Reviews 45:2 (2003), 167–256.
20. M. E. J. Newman. “Power Laws, Pareto Distributions and Zipf’s Law.” Contemporary Physics 46 (2005), 323.
21. G. Pandurangan, P. Raghavan, and E. Upfal. “Using Page- Rank to Characterize Web Structure.” In Computing and Combinatorics: 8th Annual International Conference, COCOON 2002, Singapore, August 15–17, 2002, Proceedings, pp. 330–339, Lecture Notes in Computer Science 2387. Berlin: Springer, 2002.
22. M. Petkovsek, H. S. Wilf, and D. Zeilberger. A=B. Wellesley, MA: A K Peters, 1996.
23. S. M. Ross. Applied Probability Models With Optimization Applications. New York: Courier Dover Publications, 1992.
24. D. Zeilberger. “Doron Zeilberger’s Maple Packages and Programs.” Available at http://www.math.temple.edu/∼zeilberg/programs.html, 2001.