Skip to main content
Book cover

International Workshop on Algorithms and Models for the Web-Graph

WAW 2014: Algorithms and Models for the Web Graph pp 120–131Cite as

PageRank in Scale-Free Random Graphs

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

Abstract

We analyze the distribution of PageRank on a directed configuration model and show that as the size of the graph grows to infinity, the PageRank of a randomly chosen node can be closely approximated by the PageRank of the root node of an appropriately constructed tree. This tree approximation is in turn related to the solution of a linear stochastic fixed-point equation that has been thoroughly studied in the recent literature.

The second author was partially funded by the EU-FET Open grant NADINE (288956). The third author was supported by the NSF grant CMMI-1131053.

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-319-13123-8_10
  • Chapter length: 12 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   39.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-13123-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   49.99
Price excludes VAT (USA)
Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alsmeyer, G., Damek, E., Mentemeier, S.: Tails of fixed points of the two-sided smoothing transform. In: Springer Proceedings in Mathematics & Statistics: Random Matrices and Iterated Random Functions (2012)

    Google Scholar 

  2. Alsmeyer, G., Meiners, M.: Fixed points of the smoothing transform: Two-sided solutions. Probab. Theory Relat. Fields 155(1–2), 165–199 (2013)

    CrossRef  MATH  MathSciNet  Google Scholar 

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

    CrossRef  MATH  MathSciNet  Google Scholar 

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

    CrossRef  Google Scholar 

  5. Chen, N., Litvak, N., Olvera-Cravioto, M.: Ranking algorithms on directed configuration networks. ArXiv:1409.7443, pp. 1–39 (2014)

  6. Chen, N., Olvera-Cravioto, M.: Directed random graphs with given degree distributions. Stochastic Systems 3(1), 147–186 (2013)

    CrossRef  MATH  Google Scholar 

  7. Jelenković, P.R., Olvera-Cravioto, M.: Information ranking and power laws on trees. Adv. Appl. Prob. 42(4), 1057–1093 (2010)

    CrossRef  MATH  Google Scholar 

  8. Jelenković, P.R., Olvera-Cravioto, M.: Implicit renewal theory and power tails on trees. Adv. Appl. Prob. 44(2), 528–561 (2012)

    CrossRef  MATH  Google Scholar 

  9. Jelenković, P.R., Olvera-Cravioto, M.: Implicit renewal theory for trees with general weights. Stochastic Process. Appl. 122(9), 3209–3238 (2012)

    CrossRef  MATH  MathSciNet  Google Scholar 

  10. Langville, A.N., Meyer, C.D.: Google PageRank and beyond. Princeton University Press (2006)

    Google Scholar 

  11. Litvak, N., Scheinhardt, W.R.W., Volkovich, Y.: In-degree and PageRank: Why do they follow similar power laws? Internet Mathematics 4(2), 175–198 (2007)

    CrossRef  MathSciNet  Google Scholar 

  12. Olvera-Cravioto, M.: Tail behavior of solutions of linear recursions on trees. Stochastic Process. Appl. 122(4), 1777–1807 (2012)

    CrossRef  MATH  MathSciNet  Google Scholar 

  13. Pandurangan, G., Raghavan, P., Upfal, E.: Using PageRank to characterize web structure. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 330–339. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  14. van der Hofstad, R.: Random graphs and complex networks (2009)

    Google Scholar 

  15. Volkovich, Y., Litvak, N.: Asymptotic analysis for personalized web search. Adv. Appl. Prob. 42(2), 577–604 (2010)

    CrossRef  MATH  MathSciNet  Google Scholar 

  16. Volkovich, Y., Litvak, N., Donato, D.: Determining factors behind the pagerank log-log plot. In: Proceedings of the 5th International Workshop on Algorithms and Models for the Web-graph, pp. 108–123 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Columbia University, 500 W. 120th Street, 3rd floor, New York, NY, 10027, USA

    Ningyuan Chen & Mariana Olvera-Cravioto

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

    Nelly Litvak

Authors
  1. Ningyuan Chen
    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. Mariana Olvera-Cravioto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mariana Olvera-Cravioto .

Editor information

Editors and Affiliations

  1. Ryerson University, Toronto, Ontario, Canada

    Anthony Bonato

  2. University of California San Diego, La Jolla, California, USA

    Fan Chung Graham

  3. Ryerson University, Toronto, Ontario, Canada

    Paweł Prałat

Rights and permissions

Reprints and Permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Chen, N., Litvak, N., Olvera-Cravioto, M. (2014). PageRank in Scale-Free Random Graphs. In: Bonato, A., Graham, F., Prałat, P. (eds) Algorithms and Models for the Web Graph. WAW 2014. Lecture Notes in Computer Science(), vol 8882. Springer, Cham. https://doi.org/10.1007/978-3-319-13123-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13123-8_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13122-1

  • Online ISBN: 978-3-319-13123-8

  • eBook Packages: Computer ScienceComputer Science (R0)