In-degree and PageRank: Why do they follow similar power laws?

Internet Mathematics

Volumn 4, Issue 2-3, 2007, Pages 175-198

  Litvak, N ^a   Scheinhardt, W R ^a   Volkovich, Y ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77950430120     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2007.10129293     Document Type: Article

References (23)

1. D. J. Aldous and A. Bandyopadhyay. “A Survey of Max-Type Recursive Distributional Equations.” Ann. Appl. Probab. 15 (2005), 1047–1110.
2. K. Avrachenkov and D. Lebedev. “PageRank of Scale-Free Growing Networks.” Internet Mathematics 3:2 (2006), 207–231.
3. K. Avrachenkov and N. Litvak. “The Effect of New Links on Google PageRank.” Stoch. Models 22:2 (2006), 319–331.
4. A.-L. Barabási and R. Albert. “Emergence of Scaling in Random Networks.” Science 286 (1999), 509–512.
5. L. Becchetti and C. Castillo. “The Distribution of PageRank Follows a Power-Law Only for Particular Values of the Damping Factor.” In Proceedings of the 15th International Conference on World Wide Web, pp. 941–942. New York: ACM Press, 2006.
6. P. Berkhin. “A Survey on PageRank Computing.” Internet Mathematics 2 (2005), 73–120.
7. N. H. Bingham and R. A. Doney. “Asymptotic Properties of Supercritical Branching Processes. I. The Galton-Watson Process.” Advances in Appl. Probability 6 (1974), 711–731.
8. N. H. Bingham, C. M. Goldie, and J. L. Teugels. Regular Variation. Cambridge, UK: Cambridge University Press, 1989.
9. 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 (2001), 279–290.
10. S. Brin and L. Page. “The Anatomy of a Large-Scale Hypertextual Web Search Engine.” Comput. Networks ISDN Systems 33 (1998), 107–117.
11. A. De Meyer and J. L. Teugels. “On the Asymptotic Behaviour of the Distributions of the Busy Period and Service Time in M/G/1.” J. App. Probab. 17 (1980), 802–813.
12. D. Donato, L. Laura, S. Leonardi, and S. Millozi.” “Large Scale Properties of the Webgraph. Eur. Phys. J. 38 (2004), 239–243.
13. N. Eiron, K. S. McCurley, and J. A. Tomlin. “Ranking the Web frontier.” In Proceedings of the 13th International Conference on World Wide Web, pp. 309–318. New York: ACM Press, 2004.
14. S. Fortunato and A. Flammini. “Random Walks on Directed Networks: The Case of PageRank.” Technical Report 0604203, arXiv/physics, 2006.
15. S. Fortunato, M. Boguna, A. Flammini, and F. Menczer. “Approximating PageRank from In-Degree.” In Algorithms and Models for the Web Graph: Fourth International Workshop, WAW 2006, Banff, Canada, November 30–December 1, 2006, Revised Papers, Lecture Notes in Computer Science 4936, pp. 59–71. Berlin: Springer, 2008.
16. M. L. Goldstein, S. A. Morris, and G. G. Yen.” “Problems with Fitting to the Power-Law Distribution. Eur. Phys. J. 41 (2004), 255–258.
17. T. H. Haveliwala. “Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search.” IEEE TKDE, 15:4 (2003), 784–796.
18. S. Kamvar. “Sep Kamvar: Research and Portfolio.” http://www.stanford.edu/~sdkamvar/research.html, accessed in March 2006.
19. A. N. Langville and C. D. Meyer. “Deeper Inside PageRank.” Internet Mathematics 1 (2003), 335–380.
20. M. E. J. Newman. “Power Laws, Pareto Distributions and Zipf’s law.” Contemporary Physics 46 (2005), 323–351.
21. G. Pandurangan, P. Raghavan, and E. Upfal. “Using PageRank to Characterize Web Structure.” In Computing and Combinatorics: 8th Annual International Conference, COCOON 2002, Singapore, August 15–17, 2002, Proceedings, Lecture Notes in Computer Science 2387, 330–339. Berlin: Springer, 2002.
22. P. Robert. Stochastic Networks and Queues. New York: Springer, 2003.
23. A. P. Zwart. Queueing Systems with Heavy Tails. PhD thesis, Eindhoven University of Technology, 2001.