How to make the top ten: Approximating PageRank from in-degree

Abstract

PageRank has become 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.

8 pages, 7 figures, 2 tables

Cited by in corpus (9)

• Finding Scientific Gems with Google
• Promise and Pitfalls of Extending Google's PageRank Algorithm to Citation Networks
• Improving detection of influential nodes in complex networks
• Random Walks on Directed Networks: the Case of PageRank
• Determining factors behind the PageRank log-log plot
• Rich-club and page-club coefficients for directed graphs
• Clustering in large networks does not promote upstream reciprocity
• Estimating the Degree Centrality Ranking of a Node
• Index wiki database: design and experiments