Algorithms and Models for the Web-Graph

Volume 4936 of the series Lecture Notes in Computer Science pp 59-71

Approximating PageRank from In-Degree

  • Santo FortunatoAffiliated withSchool of Informatics, Indiana UniversityComplex Networks Lagrange Laboratory (CNLL), ISI Foundation
  • , Marián BoguñáAffiliated withDepartament de Física Fonamental, Universitat de Barcelona
  • , Alessandro FlamminiAffiliated withSchool of Informatics, Indiana University
  • , Filippo MenczerAffiliated withSchool of Informatics, Indiana University

* Final gross prices may vary according to local VAT.

Get Access


PageRank is a key element in the success of search engines, allowing to rank the most important hits in the top screen of results. One key aspect that distinguishes PageRank from other prestige measures such as in-degree is its global nature. From the information provider perspective, this makes it difficult or impossible to predict how their pages will be ranked. Consequently a market has emerged for the optimization of search engine results. Here we study the accuracy with which PageRank can be approximated by in-degree, a local measure made freely available by search engines. Theoretical and empirical analyses lead to conclude that given the weak degree correlations in the Web link graph, the approximation can be relatively accurate, giving service and information providers an effective new marketing tool.