Axiomatic characterization of PageRank

DOI10.1016/J.ARTINT.2023.103900MaRDI QIDQ6161485zbMATH OpenOpenAlexFDO

Authors Tomasz Wąs, Oskar Skibski

Publication date 27 June 2023

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2010.08487

zbMATH Keywords

axiomscentrality measuresnetworksPageRank

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Abstract: This paper examines the fundamental problem of identifying the most important nodes in a network. We use an axiomatic approach to this problem. Specifically, we propose six simple properties and prove that PageRank is the only centrality measure that satisfies all of them. Our work gives new conceptual and theoretical foundations of PageRank that can be used to determine suitability of this centrality measure in specific applications.

Recommendations

• On some analytical properties of a general PageRank algorithm
• PageRank in Undirected Random Graphs
• Mathematical properties and analysis of Google's PageRank
• A note on the PageRank of undirected graphs
• A continuum limit for the PageRank algorithm
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• An Arnoldi-extrapolation algorithm for computing pagerank
• A Reordering for the PageRank Problem
• A Survey on PageRank Computing

Cites work

• A connectivity game for graphs
• A faster algorithm for betweenness centrality*
• A new status index derived from sociometric analysis
• A Survey on PageRank Computing
• Adaptive methods for the computation of PageRank
• Attachment centrality: measure for connectivity in networks
• Authoritative sources in a hyperlinked environment
• Axiomatic characterization of game-theoretic centrality
• Axioms for Centrality
• Axioms for centrality scoring with principal eigenvectors
• Characterizations of the - and the degree network power measure
• Cooperative game theoretic centrality analysis of terrorist networks: the cases of Jemaah Islamiyah and Al Qaeda
• Deeper Inside PageRank
• Fast PageRank Computation via a Sparse Linear System
• Google's PageRank and beyond. The science of search engine rankings
• Identifying sets of key players in a social network
• Link Evolution: Analysis and Algorithms
• Local and consistent centrality measures in parameterized networks
• Network analysis. Methodological foundations.
• Networks. An introduction.
• PageRank beyond the web
• Scoring of web pages and tournaments-axiomatizations
• STACS 2005
• The centrality index of a graph
• The Effect of New Links on Google Pagerank
• The Measurement of Intellectual Influence
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
• Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
• Traps and Pitfalls of Topic-Biased PageRank

This page was built for publication: Axiomatic characterization of PageRank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6161485)