The long-term impact of ranking algorithms in growing networks

Abstract

When we search online for content, we are constantly exposed to rankings. For example, web search results are presented as a ranking, and online bookstores often show us lists of best-selling books. While popularity-based ranking algorithms (like Google's PageRank) have been extensively studied in previous works, we still lack a clear understanding of their potential systemic consequences. In this work, we fill this gap by introducing a new model of network growth that allows us to compare the properties of the networks generated under the influence of different ranking algorithms. We show that by correcting for the omnipresent age bias of popularity-based ranking algorithms, the resulting networks exhibit a significantly larger agreement between the nodes' inherent quality and their long-term popularity, and a less concentrated popularity distribution. To further promote popularity diversity, we introduce and validate a perturbation of the original rankings where a small number of randomly-selected nodes are promoted to the top of the ranking. Our findings move the first steps toward a model-based understanding of the long-term impact of popularity-based ranking algorithms, and could be used as an informative tool for the design of improved information filtering tools.

arXiv commentMain text (pp. 1-27) and Supplementary Material (pp. 28-49)

References in corpus (25)

• Influence maximization in complex networks through optimal percolation
• Vital nodes identification in complex networks
• Recommender Systems
• Solving the apparent diversity-accuracy dilemma of recommender systems
• Quantifying Long-Term Scientific Impact
• Leaders in Social Networks, the Delicious Case
• Diffusion of scientific credits and the ranking of scientists
• Causality-Driven Slow-Down and Speed-Up of Diffusion in Non-Markovian Temporal Networks
• Representing higher-order dependencies in networks
• Ranking in evolving complex networks
• The first-mover advantage in scientific publication
• How algorithmic popularity bias hinders or promotes quality
• Temporal effects in the growth of networks
• Scale-free network growth by ranking
• The egalitarian effect of search engines
• Estimating the Causal Impact of Recommendation Systems from Observational Data
• Experience versus Talent Shapes the Structure of the Web
• Leveraging percolation theory to single out influential spreaders in networks
• Identification of milestone papers through time-balanced network centrality
• Early identification of important patents through network centrality
• Ranking nodes in growing networks: When PageRank fails
• Quantifying and suppressing ranking bias in a large citation network
• Model-based evaluation of scientific impact indicators
• Randomizing growing networks with a time-respecting null model
• Modeling mutual feedback between users and recommender systems

Cited by in corpus (5)

• Identification of influencers in complex networks by local information dimensionality
• Network-based ranking in social systems: three challenges
• Vital Spreaders Identification in Complex Networks with Multi-Local Dimension
• Predicting Nodal Influence via Local Iterative Metrics
• A Sociotechnical View of Algorithmic Fairness