How to make the top ten: Approximating PageRank from in-degree
Santo Fortunato, Marian Boguna, Alessandro Flammini, Filippo Menczer
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.
Create a lesson
Related papers
misi: a Metric Inverted Sample Index
Edgar Chavez
Scaling Graph Neural Networks for Friend Recommendation: Multi-Hash User Embeddings and Temporal Neighbor Sampling
Maksim Utushkin, Andrei Ovsiannikov, Alexander D'yakonov
Stageboost: Recommending Signals Based on Counterfactual Estimation
Darpan Singhal, Matan Mandelbrod, Tal Franji et al.
Astar: Learning to Propose Evolution Directions for Self-Evolving Industrial AI Systems
Jinxin Hu, Hao Deng, Haibo Xing et al.
ProRetrieval: Learning to Orchestrate Hybrid Search via Executable Program Synthesis
Chengsong You, Zhen Sun, Yunhai Hu et al.
Conversational Recommendation over Live E-Commerce Catalogues with Self-Refreshing Retrieval
Ante Kapetanovic, Tomislav Duricic, Dionizije Fa et al.