pith. sign in

arxiv: cond-mat/0402050 · v1 · submitted 2004-02-02 · ❄️ cond-mat.other

A measure of centrality based on the network efficiency

classification ❄️ cond-mat.other
keywords centralitymeasurenetworkinformationappliesclassesclassiccompared
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.