A measure of centrality based on the network efficiency

TL;DR

This paper proposes a new centrality measure, information centrality C^I, which assesses node importance based on information propagation efficiency, applicable to various types of networks and groups.

Contribution

The paper introduces the information centrality C^I, a novel measure that extends centrality analysis to valued and non-valued graphs, including groups and classes.

Findings

C^I effectively captures node importance based on information flow

Comparison shows C^I provides different insights than traditional measures

Illustrated using a classic network dataset

Abstract

We introduce a new measure of centrality, the information centrality C^I, based on the concept of efficient propagation of information over the network. C^I is defined for both valued and non-valued graphs, and applies to groups and classes as well as individuals. The new measure is illustrated and compared to the standard centrality measures by using a classic network data set.