Selection of Centrality Measures Using Self-Consistency and Bridge Axioms
arXiv:2301.00084 · doi:10.1093/comnet/cnad035
Abstract
We consider several families of network centrality measures induced by graph kernels, which include some well-known measures and many new ones. The Self-consistency and Bridge axioms, which appeared earlier in the literature, are closely related to certain kernels and one of the families. We obtain a necessary and sufficient condition for Self-consistency, a sufficient condition for the Bridge axiom, indicate specific measures that satisfy these axioms, and show that under some additional conditions they are incompatible. PageRank centrality applied to undirected networks violates most conditions under study and has a property that according to some authors is ``hard to imagine'' for a centrality measure. We explain this phenomenon. Adopting the Self-consistency or Bridge axiom leads to a drastic reduction in survey time in the culling method designed to select the most appropriate centrality measures.
arXiv comment23 pages, 5 figures. A reworked version. Accepted for publication in Journal of Complex Networks
References in corpus (12)
- Subgraph Centrality in Complex Networks
- The Key Player Problem in Complex Oscillator Networks and Electric Power Grids: Resistance Centralities Identify Local Vulnerabilities
- On Proximity Measures for Graph Vertices
- A general centrality framework based on node navigability
- Similarities on Graphs: Kernels versus Proximity Measures
- Measuring centrality by a generalization of degree
- The graph bottleneck identity
- Preference fusion when the number of alternatives exceeds two: indirect scoring procedures
- Some impossibilities of ranking in generalized tournaments
- An impossibility theorem for paired comparisons
- Journal ranking should depend on the level of aggregation
- Dissecting graph measure performance for node clustering in LFR parameter space