Abstract This paper proposes an alternative way to identify nodes with high betweenness centrality. It introduces a new metric, κ-path centrality, and a randomized algorithm for estimating it, and shows empirically that nodes with high κ-path centrality have high node betweenness centrality. The randomized algorithm runs in time O(κ 3 n 2−2α log n) and outputs, for each vertex v, an estimate of its κ-path centrality up to additive error of ±n 1/2+α with probability 1 − 1/n 2 . Experimental evaluations on real and synthetic social networks show improved accuracy in detecting high betweenness centrality nodes and significantly reduced execution time when compared to existing randomized algorithms.
Kourtellis et al. REF introduce a new metric and show empirically that nodes with high this metric have high BC values, and then focus on computing this alternative metric efficiently.
Identifying high betweenness centrality nodes in large social networks
Springer Journal on Social Network Analysis and Mining, Volume 3, Issue 4, pp. 899-914 (December 2013)
Computer Science Mathematics