The delta-betweenness centrality

In this paper we consider the extension of the betweenness centrality measure which is used in social and computer communication networks to estimate the potential monitoring and control capabilities a node may have on data flowing in the network. Unlike the standard betweenness centrality measure which takes into account only the shortest paths between the nodes of given network, our, so-called Δ-betweenness centrality measure is based on short paths between the nodes. We present an efficient algorithm for computing this measure and show experimental results supporting the importance of newly defined measure.