Capability centrality: the next step from scale-free property
For network scientists, this offers a new tool to characterize real networks and model them more accurately.
The paper introduces a new centrality measure, ksi-centrality, which distinguishes real networks from random ones and is independent of scale-freeness. It also relates a normalized version to algebraic connectivity and provides a method to choose the parameter m in the Barabasi-Albert model.
In this article we present a new centrality measure called ksi-centrality. We show that ksi-centrality distinguishes real networks from random ones, similar to degree centrality: the ksi-centrality distribution is right-skewed for real networks and centered for random Erdos-Renyi networks, and has linear pattern with a heavy tail on a log plot. Furthermore, the ksi-centrality distribution is centered for models simulating real networks: Barabasi-Albert, Watts-Strogatz, and Boccaletti-Hwang-Latora. Thus, this centrality distribution is an additional and independent property with respect to scale-freeness. We also introduce a normalized version of ksi-centrality and show that it is related to algebraic connectivity and the Chegeer's value of a network. Moreover, the average value of this normalized centrality is in bijective correspondence with the relative number of edges that a new node connects to others in the Barabasi-Albert preferential attachment model, thus answering the question of how to choose the parameter $m$ to model a given real-world network.