A general centrality framework based on node navigability
arXiv:1812.08012 · doi:10.1109/TKDE.2019.2947035
Abstract
Centrality metrics are a popular tool in Network Science to identify important nodes within a graph. We introduce the Potential Gain as a centrality measure that unifies many walk-based centrality metrics in graphs and captures the notion of node navigability, interpreted as the property of being reachable from anywhere else (in the graph) through short walks. Two instances of the Potential Gain (called the Geometric and the Exponential Potential Gain) are presented and we describe scalable algorithms for computing them on large graphs. We also give a proof of the relationship between the new measures and established centralities. The geometric potential gain of a node can thus be characterized as the product of its Degree centrality by its Katz centrality scores. At the same time, the exponential potential gain of a node is proved to be the product of Degree centrality by its Communicability index. These formal results connect potential gain to both the "popularity" and "similarity" properties that are captured by the above centralities.
26 pages, 11 figures. To be published in IEEE Transactions on Knowledge and Data Engineering
References in corpus (12)
- The structure of scientific collaboration networks
- The large-scale organization of metabolic networks
- The Dynamics of Viral Marketing
- Structural Vulnerability of the North American Power Grid
- Subgraph Centrality in Complex Networks
- Search in Power-Law Networks
- Vital nodes identification in complex networks
- Identity and Search in Social Networks
- Vertex similarity in networks
- The Physics of Communicability in Complex Networks
- On the limiting behavior of parameter-dependent network centrality measures
- Analysis of a heterogeneous social network of humans and cultural objects