On Decay Centrality

Abstract

We establish a relationship between decay centrality and two widely used and computationally cheaper measures of centrality, namely degree and closeness. We show that for low values of the decay parameter the nodes with maximum decay centrality also have maximum degree, whereas for high values of the decay parameter they also maximize closeness. For intermediate values, we provide sufficient conditions that allow the comparison of decay centrality of different nodes and we show via numerical simulations that in the vast majority of networks, the nodes with maximum decay centrality are characterized by a threshold on the decay parameter below which they belong to the set of nodes with maximum degree and above which they belong to the set of nodes with maximum closeness. We also propose a simple rule of thumb that ensures a nearly optimal choice with very high probability.