Skip to main content
SpringerLink
Log in

Probabilistic Relation between In-Degree and PageRank

  • Conference paper
Algorithms and Models for the Web-Graph (WAW 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4936))

Included in the following conference series:

Abstract

This paper presents a novel stochastic model that explains the relation between power laws of In-Degree and PageRank. PageRank is a popularity measure designed by Google to rank Web pages. We model the relation between PageRank and In-Degree through a stochastic equation, which is inspired by the original definition of PageRank. Using the theory of regular variation and Tauberian theorems, we prove that the tail distributions of PageRank and In-Degree differ only by a multiplicative constant, for which we derive a closed-form expression. Our analytical results are in good agreement with Web data.

Categories and Subject Descriptors

H.3.3:[Information Storage and Retrieval]: Information Search and Retrieval– Retrieval models; G.3:[Mathematics of Computing]: Probability and statistics – Stochastic processes, Distribution functions

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Litvak, N., Scheinhardt, W.R.W., Volkovich, Y.: In-Degree and PageRank: Why do they follow similar power laws? (to appear in Internet Math.)

    Google Scholar 

  2. Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 33, 107–117 (1998)

    Article  Google Scholar 

  3. Pandurangan, G., Raghavan, P., Upfal, E.: Using PageRank to characterize Web structure. In: H. Ibarra, O., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Donato, D., Laura, L., Leonardi, S., Millozi, S.: Large scale properties of the Webgraph. Eur. Phys. J. 38, 239–243 (2004)

    Google Scholar 

  5. Fortunato, S., Flammini, A., Menczer, F., Vespignani, A.: The egalitarian effect of search engines (2005), arxiv.org/cs/0511005

  6. Becchetti, L., Castillo, C.: 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. ACM Press, New York (2006)

    Chapter  Google Scholar 

  7. Berkhin, P.: A survey on PageRank computing. Internet Math. 2, 73–120 (2005)

    MATH  MathSciNet  Google Scholar 

  8. Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Internet Math. 1, 335–380 (2003)

    MathSciNet  Google Scholar 

  9. Robert, P.: Stochastic networks and queues. Springer, New York (2003)

    MATH  Google Scholar 

  10. Meyer, A.D., Teugels, J.L.: On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1. J. App. Probab. 17, 802–813 (1980)

    Article  MATH  Google Scholar 

  11. Zwart, A.P.: Queueing Systems with Heavy Tails. PhD thesis, Eindhoven University of Technology (2001)

    Google Scholar 

  12. Bingham, N.H., Doney, R.A.: Asymptotic properties of supercritical branching processes. I. The Galton-Watson process. Advances in Appl. Probability 6, 711–731 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  13. Bingham, N.H., Goldie, C.M., Teugels, J.L.: Regular Variation. Cambridge University Press, Cambridge (1989)

    MATH  Google Scholar 

  14. Avrachenkov, K., Litvak, N., Nemirovsky, D., Osipova, N.: Monte Carlo methods in PageRank computation: When one iteration is sufficient (electronic). SIAM Journal on Numerical Analysis 45(2), 890–904 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  15. 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, Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  16. Aldous, D., Bandyopadhyay, A.: A survey of max-type recursive distributional equations. Ann. Appl. Probab. 15, 1047–1110 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  17. Stanford dataset: (Accessed in March 2006), http://www.stanford.edu/simsdkamvar/research.html

  18. Newman, M.E.J.: Power laws, Pareto distributions and Zipf’s law. Contemporary Physics 46, 323–351 (2005)

    Article  Google Scholar 

  19. Avrachenkov, K., Lebedev, D.: PageRank of scale free growing networks. Internet Mathematics 3(2), 207–231 (2006)

    MATH  MathSciNet  Google Scholar 

  20. Fortunato, S., Flammini, A.: Random walks on directed networks: The case of PageRank (2006), arxiv.org/physics/0604203

  21. Albert, R., Barabási, A.L.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  22. Haveliwala, T.H.: Topic-sensitive PageRank. In: Proceedings of the Eleventh International World Wide Web Conference, Honolulu, Hawaii (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Applied Mathematics, University of Twente, P.O. Box 217, 7500AE, Enschede, The Netherlands

    Nelly Litvak, Werner R. W. Scheinhardt & Yana Volkovich

Authors
  1. Nelly Litvak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Werner R. W. Scheinhardt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yana Volkovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

William Aiello Andrei Broder Jeannette Janssen Evangelos Milios

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Litvak, N., Scheinhardt, W.R.W., Volkovich, Y. (2008). Probabilistic Relation between In-Degree and PageRank. In: Aiello, W., Broder, A., Janssen, J., Milios, E. (eds) Algorithms and Models for the Web-Graph. WAW 2006. Lecture Notes in Computer Science, vol 4936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78808-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78808-9_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78807-2

  • Online ISBN: 978-3-540-78808-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation