Approximating PageRank from In-Degree

  • Authors:
  • Santo Fortunato;Marián Boguñá;Alessandro Flammini;Filippo Menczer

  • Affiliations:
  • School of Informatics, Indiana University, Bloomington, USA IN 47406 and Complex Networks Lagrange Laboratory (CNLL), ISI Foundation, Torino, Italy;Departament de Física Fonamental, Universitat de Barcelona, Barcelona, Spain 08028;School of Informatics, Indiana University, Bloomington, USA IN 47406;School of Informatics, Indiana University, Bloomington, USA IN 47406

  • Venue:
  • Algorithms and Models for the Web-Graph
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.