Can the PageRank centrality be manipulated to obtain any desired ranking?

The significance of the PageRank algorithm in shaping the modern Internet cannot be overstated, and its Complex Network theory foundations continue to be a subject of research. In this article we carry out a systematic study of the structural and parametric controllability of PageRank's outcome...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Contreras-Aso, Gonzalo, Criado, Regino, Romance, Miguel
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 10.10.2023
Subjects
Computer Science - Social and Information Networks
Mathematics - Combinatorics
Physics - Physics and Society
Search algorithms
Online AccessGet full text

Cover

More Information
Summary:The significance of the PageRank algorithm in shaping the modern Internet cannot be overstated, and its Complex Network theory foundations continue to be a subject of research. In this article we carry out a systematic study of the structural and parametric controllability of PageRank's outcomes, translating a spectral Graph Theory problem into a geometric one, where a natural characterization of its rankings emerges. Furthermore, we show that the change of perspective employed can be applied to the biplex PageRank proposal, performing numerical computations on both real and synthetic network datasets to compare centrality measures used.
Bibliography:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.2211.12929