Approximating PageRank from In-Degree

  • Santo Fortunato
  • Marián Boguñá
  • Alessandro Flammini
  • Filippo Menczer
Conference paper

DOI: 10.1007/978-3-540-78808-9_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4936)
Cite this paper as:
Fortunato S., Boguñá M., Flammini A., Menczer F. (2008) Approximating PageRank from In-Degree. In: Aiello W., Broder A., Janssen J., Milios E. (eds) Algorithms and Models for the Web-Graph. WAW 2006. Lecture Notes in Computer Science, vol 4936. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Santo Fortunato
    • 1
    • 2
  • Marián Boguñá
    • 3
  • Alessandro Flammini
    • 1
  • Filippo Menczer
    • 1
  1. 1.School of InformaticsIndiana UniversityBloomingtonUSA
  2. 2.Complex Networks Lagrange Laboratory (CNLL)ISI FoundationTorinoItaly
  3. 3.Departament de Física FonamentalUniversitat de BarcelonaBarcelonaSpain

Personalised recommendations