Internet Mathematics

On Local Estimations of PageRank: A Mean Field Approach

Santo Fortunato, Mariá Bofuñá, Alessandro Flammini, and Filippo Menczer

Full-text: Open access

Abstract

PageRank is a key element in the success of search engines, allowing the display of the most relevant hits in the first 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 even 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 us to conclude that, given the weak degree of correlations in the Web link graph, the approximation can be relatively accurate, giving service and information providers an effective new marketing tool.

Article information

Source
Internet Math., Volume 4, Number 2-3 (2007), 245-266.

Dates
First available in Project Euclid: 27 May 2009

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

Mathematical Reviews number (MathSciNet)
MR2522878

Zentralblatt MATH identifier
1206.68350

Citation

Fortunato, Santo; Bofuñá, Mariá; Flammini, Alessandro; Menczer, Filippo. On Local Estimations of PageRank: A Mean Field Approach. Internet Math. 4 (2007), no. 2-3, 245--266. https://projecteuclid.org/euclid.im/1243430608


Export citation