Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Algorithms and Models for the Web-Graph

WAW 2007: Algorithms and Models for the Web-Graph pp 16–28Cite as

Distribution of PageRank Mass Among Principle Components of the Web

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4863))

Abstract

We study the PageRank mass of principal components in a bow-tie Web Graph, as a function of the damping factor c. Using a singular perturbation approach, we show that the PageRank share of IN and SCC components remains high even for very large values of the damping factor, in spite of the fact that it drops to zero when c→1. However, a detailed study of the OUT component reveals the presence of “dead-ends” (small groups of pages linking only to each other) that receive an unfairly high ranking when c is close to one. We argue that this problem can be mitigated by choosing c as small as 1/2.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the Web. Technical report, Stanford University (1998)

    Google Scholar 

  2. Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM 46(5), 604–632 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Lempel, R., Moran, S.: The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Comput. Networks 33(1-6), 387–401 (2000)

    Article  Google Scholar 

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

    MathSciNet  Google Scholar 

  5. Langville, A.N., Meyer, C.D.: Google’s PageRank and beyond: the science of search engine rankings. Princeton University Press, Princeton, NJ (2006)

    MATH  Google Scholar 

  6. Boldi, P., Santini, M., Vigna, S.: PageRank as a function of the damping factor. In: Proc. of the Fourteenth International World Wide Web Conference, Chiba, Japan, ACM Press, New York (2005)

    Google Scholar 

  7. Avrachenkov, K., Litvak, N.: The effect of new links on Google PageRank. Stoch. Models 22(2), 319–331 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bianchini, M., Gori, M., Scarselli, F.: Inside PageRank. ACM Trans. Inter. Tech. 5(1), 92–128 (2005)

    Article  Google Scholar 

  9. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Statac, R., Tomkins, A., Wiener, J.: Graph structure in the Web. Computer Networks 33, 309–320 (2000)

    Article  Google Scholar 

  10. Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: The Web as a graph. In: PODS 2000. Proc. 19th ACM SIGACT-SIGMOD-AIGART Symp. Principles of Database Systems, pp. 1–10. ACM Press, New York (2000)

    Google Scholar 

  11. Avrachenkov, K.: Analytic Perturbation Theory and its Applications. PhD thesis, University of South Australia (1999)

    Google Scholar 

  12. Korolyuk, V.S., Turbin, A.F.: Mathematical foundations of the state lumping of large systems. Mathematics and its Applications, vol. 264. Kluwer Academic Publishers, Dordrecht (1993)

    MATH  Google Scholar 

  13. Pervozvanskii, A.A., Gaitsgori, V.G.: Theory of Suboptimal Decisions. Mathematics and its Applications (Soviet Series), vol. 12. Kluwer Academic Publishers, Dordrecht (1988)

    MATH  Google Scholar 

  14. Yin, G.G., Zhang, Q.: Discrete-time Markov chains. Applications of Mathematics (New York), vol. 55. Springer, New York (2005)

    MATH  Google Scholar 

  15. Chen, P., Xie, H., Maslov, S., Redner, S.: Finding scientific gems with Google. Arxiv preprint Physics 0604130 (2006)

    Google Scholar 

  16. Avrachenkov, K., Litvak, N., Pham, K.: Distribution of PageRank mass among principle components of the Web. Arxiv preprint CS 0709.2016 (2007)

    Google Scholar 

  17. Dill, S., Kumar, R., McCurley, K.S., Rajagopalan, S., Sivakumar, D., Tomkins, A.: Self-similarity in the Web. ACM Trans. Inter. Tech. 2(3), 205–223 (2002)

    Article  Google Scholar 

  18. Haveliwala, T.: Topic-sensitive PageRank: A context-sensitive ranking algorithm for Web search. IEEE Transactions on Knowledge and Data Engineering 15(4), 784–796 (2003)

    Article  Google Scholar 

  19. Moler, C., Moler, K.: Numerical Computing with MATLAB. In: SIAM (2003)

    Google Scholar 

  20. Eiron, N., McCurley, K., Tomlin, J.: Ranking the Web frontier. In: WWW 2004: Proceedings of the 13th international conference on World Wide Web, pp. 309–318. ACM Press, New York (2004)

    Chapter  Google Scholar 

  21. Seneta, E.: Non-negative Matrices and Markov Chains. Springer Series in Statistics. Springer, New York, Revised reprint of the second (1981) edition [Springer-Verlag, New York MR0719544] (2006)

    Google Scholar 

  22. Fortunato, S., Flammini, A.: Random walks on directed networks: the case of PageRank. Arxiv preprint Physics 0604203 (2006)

    Google Scholar 

  23. Avrachenkov, K., Litvak, N., Nemirovsky, D., Osipova, N.: Monte Carlo methods in PageRank computation: When one iteration is sufficient. SIAM J. Numer. Anal. 45(2), 890–904 (2007)

    Article  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA Sophia Antipolis, 2004, Route des Lucioles, 06902, France

    Konstantin Avrachenkov

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

    Nelly Litvak

  3. St.Petersburg State University, 35, University Prospect, 198504, Peterhof, Russia

    Kim Son Pham

Authors
  1. Konstantin Avrachenkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nelly Litvak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kim Son Pham
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Anthony Bonato Fan R. K. Chung

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Avrachenkov, K., Litvak, N., Pham, K.S. (2007). Distribution of PageRank Mass Among Principle Components of the Web. In: Bonato, A., Chung, F.R.K. (eds) Algorithms and Models for the Web-Graph. WAW 2007. Lecture Notes in Computer Science, vol 4863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77004-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77004-6_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77003-9

  • Online ISBN: 978-3-540-77004-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation