|
Abstract This article presents a new centrality measure. The presented measure was compared with state-of-the-art measures and proved to combines two features, low computational complexity and high precision of calculations. The measure has been mathematical analyzed, and then, experiments on real-life graphs were conducted. The mathematical analysis showed many essential properties of the proposed measure. Statistical analysis of the conducted experiment showed that measure has precision the same as state-of-the-art measures with much lower computational complexity.
|
