Characterization of Tail Dependence for In-Degree and PageRank

  • Nelly Litvak
  • Werner Scheinhardt
  • Yana Volkovich
  • Bert Zwart
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5427)

Abstract

The dependencies between power law parameters such as in-degree and PageRank, can be characterized by the so-called angular measure, a notion used in extreme value theory to describe the dependency between very large values of coordinates of a random vector. Basing on an analytical stochastic model, we argue that the angular measure for in-degree and personalized PageRank is concentrated in two points. This corresponds to the two main factors for high ranking: large in-degree and a high rank of one of the ancestors. Furthermore, we can formally establish the relative importance of these two factors.

Keywords

Power law graphs PageRank Regular variation Multivariate extremes 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chakrabarti, D., Faloutsos, C.: Graph mining: Laws, generators, and algorithms. ACM Comput. Surv. 38(1), 2 (2006)CrossRefGoogle Scholar
  2. 2.
    Mitzenmacher, M.: A brief history of generative models for power law and lognormal distributions. Internet Math. 1(2), 226–251 (2004)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Donato, D., Laura, L., Leonardi, S., Millozi, S.: Large scale properties of the Webgraph. Eur. Phys. J. 38, 239–243 (2004)CrossRefGoogle Scholar
  5. 5.
    Pandurangan, G., Raghavan, P., Upfal, E.: Using PageRank to characterize Web structure. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, p. 330. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  6. 6.
    Volkovich, Y., Litvak, N., Donato, D.: Determining factors behind the PageRank log-log plot. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 108–123. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Comput. Networks 33, 107–117 (1998)Google Scholar
  8. 8.
    Fortunato, S., Boguñá, M., Flammini, A., Menczer, F.: Approximating PageRank from in-degree. In: Aiello, W., Broder, A., Janssen, J., Milios, E.E. (eds.) WAW 2006. LNCS, vol. 4936, pp. 59–71. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  9. 9.
    Beirlant, J., Goegebeur, Y., Segers, J., Teugels, J.: Statistics of Extremes: Theory and Applications. Wiley, Chichester (2004)CrossRefMATHGoogle Scholar
  10. 10.
    Resnick, S.I.: Heavy-tail Phenomena. Springer, New York (2007)MATHGoogle Scholar
  11. 11.
    Volkovich, Y., Litvak, N., Zwart, B.: Measuring extremal dependencies in Web graphs. In: WWW 2008: Proceedings of the 17th international conference on World Wide Web, pp. 1113–1114. ACM Press, New York (2008)Google Scholar
  12. 12.
    Volkovich, Y., Litvak, N., Zwart, B.: A framework for evaluating statistical dependencies and rank correlations in power law graphs. Memorandum 1868, Enschede (2008)Google Scholar
  13. 13.
    Litvak, N., Scheinhardt, W.R.W., Volkovich, Y.: Probabilistic relation between in-degree and PageRank. In: Aiello, W., Broder, A., Janssen, J., Milios, E.E. (eds.) WAW 2006. LNCS, vol. 4936, pp. 72–83. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  14. 14.
    Volkovich, Y., Litvak, N.: Asymptotic analysis for personalized Web search. Memorandum 1884, Enschede (2008)Google Scholar
  15. 15.
    Jessen, A.H., Mikosch, T.: Regularly varying functions. Publications de l’institut mathematique, Nouvelle série 79(93) (2006)Google Scholar
  16. 16.
    Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: WWW 2004: Proceedings of the 13th International Conference on World Wide Web, pp. 595–601. ACM Press, New York (2004)Google Scholar
  17. 17.
    Albert, R., Barabási, A.L.: Emergence of scaling in random networks. Science 286, 509–512 (1999)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Avrachenkov, K., Lebedev, D.: PageRank of scale-free growing networks. Internet Math. 3(2), 207–231 (2006)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    van der Hofstad, R., Hooghiemstra, G., van Mieghem, P.: Distances in random graphs with finite variance degrees. Random Structures Algorithms 27(1), 76–123 (2005)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    van der Hofstad, R., Hooghiemstra, G., Znamenski, D.: Distances in random graphs with finite mean and infinite variance degrees. Electron. J. Probab. 12(25), 703–766 (2007)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Nelly Litvak
    • 1
  • Werner Scheinhardt
    • 1
  • Yana Volkovich
    • 1
  • Bert Zwart
    • 2
  1. 1.Dept. of Applied MathematicsUniversity of TwenteEnschedeThe Netherlands
  2. 2.CWI, Science Park AmsterdamAmsterdamThe Netherlands

Personalised recommendations