Axioms for Centrality
From MaRDI portal
Publication:4985356
DOI10.1080/15427951.2013.865686zbMATH Open1461.91219DBLPjournals/im/BoldiV14arXiv1308.2140OpenAlexW2134784378WikidataQ57309473 ScholiaQ57309473MaRDI QIDQ4985356FDOQ4985356
Authors: Paolo Boldi, Sebastiano Vigna 
Publication date: 23 April 2021
Published in: Internet Mathematics (Search for Journal in Brave)
Abstract: Given a social network, which of its nodes are more central? This question has been asked many times in sociology, psychology and computer science, and a whole plethora of centrality measures (a.k.a. centrality indices, or rankings) were proposed to account for the importance of the nodes of a network. In this paper, we try to provide a mathematically sound survey of the most important classic centrality measures known from the literature and propose an axiomatic approach to establish whether they are actually doing what they have been designed for. Our axioms suggest some simple, basic properties that a centrality measure should exhibit. Surprisingly, only a new simple measure based on distances, harmonic centrality, turns out to satisfy all axioms; essentially, harmonic centrality is a correction to Bavelas's classic closeness centrality designed to take unreachable nodes into account in a natural way. As a sanity check, we examine in turn each measure under the lens of information retrieval, leveraging state-of-the-art knowledge in the discipline to measure the effectiveness of the various indices in locating web pages that are relevant to a query. While there are some examples of this comparisons in the literature, here for the first time we take into consideration centrality measures based on distances, such as closeness, in an information-retrieval setting. The results match closely the data we gathered using our axiomatic approach. Our results suggest that centrality measures based on distances, which have been neglected in information retrieval in favour of spectral centrality measures in the last years, are actually of very high quality; moreover, harmonic centrality pops up as an excellent general-purpose centrality index for arbitrary directed graphs.
Full work available at URL: https://arxiv.org/abs/1308.2140
Recommendations
- Centrality measures in networks
- Measuring centrality by a generalization of degree
- Axioms for centrality scoring with principal eigenvectors
- Centrality measure in graphs
- Axiomatic characterization of game-theoretic centrality
- Measures of centrality for multivariate and directional distributions
- scientific article; zbMATH DE number 4188100
- Centrality
- Poset centrality
- Intrinsic centrality and associated classifying properties
Cites Work
- A Mathematical Theory of Communication
- Title not available (Why is that?)
- A new status index derived from sociometric analysis
- Title not available (Why is that?)
- Authoritative sources in a hyperlinked environment
- Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices
- Two Notes on Notation
- The Effect of New Links on Google Pagerank
- The centrality index of a graph
- Complex networks. Structure, robustness and function.
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
- Harmony in the small-world
- Paradoxical Effects in PageRank Incremental Computations
- Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization
- Title not available (Why is that?)
- Inverse \(M\)-matrix inequalities and generalized ultrametric matrices
- Spatially-decaying aggregation over a network
- Link Evolution: Analysis and Algorithms
- Fast PageRank Computation via a Sparse Linear System
- Title not available (Why is that?)
Cited In (51)
- A comparative analysis of centrality measures in complex networks
- On Pareto optimality in social distance games
- Convex combinations of centrality measures
- M-centrality: identifying key nodes based on global position and local degree variation
- Centrality measures in networks
- Axioms for centrality scoring with principal eigenvectors
- Game-theoretic centrality of directed graph vertices
- How to identify experts in a community?
- Ranking nodes in general networks: a Markov multi-chain approach
- Mittag-Leffler functions and their applications in network science
- Axiomatic characterization of PageRank
- Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
- Three hypergraph eigenvector centralities
- Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph
- Degree centrality and root finding in growing random networks
- Measuring centrality by a generalization of degree
- A framework of hierarchical attacks to network controllability
- Ranking in evolving complex networks
- Resource availability in the social cloud: An economics perspective
- \(p\)-means centrality
- A Laplacian approach to stubborn agents and their role in opinion formation on influence networks
- A Theory for Backtrack-Downweighted Walks
- Local and consistent centrality measures in parameterized networks
- On the maximum betweenness improvement problem
- Re-conceptualizing centrality in social networks
- Connectivity of random graphs after centrality-based vertex removal
- A measure of centrality based on a reciprocally perturbed Markov chain for asymmetric relations
- Central Positions in Social Networks
- The effect of attacks on the railway network of Hungary
- Finding critical links for closeness centrality
- An integer programming approach for finding the most and the least central cliques
- Network Analysis
- The deformed graph Laplacian and its applications to network centrality analysis
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
- A structural analysis of topic ontologies
- Attachment centrality: measure for connectivity in networks
- Game theoretic centrality of a directed graph vertices
- Quasifibrations of graphs to find symmetries and reconstruct biological networks
- Social centrality using network hierarchy and community structure
- Reduced-order model predictive control of a fish schooling model
- Tail risk in production networks
- Formation of stable and efficient social storage cloud
- Centrality
- Dynamic Katz and related network measures
- Spectral rank monotonicity on undirected networks
- Does spending more always ensure higher cooperation? An analysis of institutional incentives on heterogeneous networks
- Optimizing node discovery on networks: problem definitions, fast algorithms, and observations
- Robust Averaging of Covariances for EEG Recordings Classification in Motor Imagery Brain-Computer Interfaces
- I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs
- Parametric controllability of the personalized PageRank: Classic model vs biplex approach
- Equilibria and centrality in link formation games
This page was built for publication: Axioms for Centrality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985356)
