Internet Mathematics

Using PageRank to characterize web structure

Gopal Pandurangan, Prabhakar Raghavan, and Eli Upfal

Full-text: Open access

Abstract

Recent work on modeling the web graph has dwelt on capturing the degree distributions observed on the web. Pointing out that this represents a heavy reliance on “local” properties of the web graph, we study the distribution of PageRank values on the web. Our measurements suggest that PageRank values on the web follow a power law. We then develop generative models for the web graph that explain this observation and moreover remain faithful to previously studied degree distributions. We analyze these models and compare the analysis to both snapshots from the web and to graphs generated by simulations on the new models. To our knowledge this represents the first modeling of the web that goes beyond fitting degree distributions on the web.

Article information

Source
Internet Math., Volume 3, Number 1 (2006), 1-20.

Dates
First available in Project Euclid: 30 March 2007

Permanent link to this document
https://projecteuclid.org/euclid.im/1175266365

Mathematical Reviews number (MathSciNet)
MR2283881

Zentralblatt MATH identifier
1113.68313

Subjects
Primary: 68U35: Information systems (hypertext navigation, interfaces, decision support, etc.) [See also 68M11]
Secondary: 05C80: Random graphs [See also 60B20] 68M10: Network design and communication [See also 68R10, 90B18]

Citation

Pandurangan, Gopal; Raghavan, Prabhakar; Upfal, Eli. Using PageRank to characterize web structure. Internet Math. 3 (2006), no. 1, 1--20. https://projecteuclid.org/euclid.im/1175266365


Export citation