Axiomatic characterization of PageRank
From MaRDI portal
Publication:6161485
DOI10.1016/J.ARTINT.2023.103900arXiv2010.08487OpenAlexW3092698439MaRDI QIDQ6161485
Publication date: 27 June 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2010.08487
Cites Work
- Unnamed Item
- Unnamed Item
- Identifying sets of key players in a social network
- Axioms for centrality scoring with principal eigenvectors
- Characterizations of the \(\beta\)- and the degree network power measure
- Adaptive methods for the computation of PageRank
- Attachment centrality: measure for connectivity in networks
- Cooperative game theoretic centrality analysis of terrorist networks: the cases of Jemaah Islamiyah and Al Qaeda
- A connectivity game for graphs
- Network analysis. Methodological foundations.
- Local and consistent centrality measures in parameterized networks
- Scoring of web pages and tournaments-axiomatizations
- The centrality index of a graph
- A new status index derived from sociometric analysis
- A faster algorithm for betweenness centrality*
- PageRank Beyond the Web
- Authoritative sources in a hyperlinked environment
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- Traps and Pitfalls of Topic-Biased PageRank
- Link Evolution: Analysis and Algorithms
- Deeper Inside PageRank
- Axioms for Centrality
- The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
- Fast PageRank Computation via a Sparse Linear System
- Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
- The Measurement of Intellectual Influence
- The Effect of New Links on Google Pagerank
- A Survey on PageRank Computing
- STACS 2005
- Networks
This page was built for publication: Axiomatic characterization of PageRank