The reviewed record of science sign in
Pith

arxiv: 1812.01292 · v2 · pith:YXNTOBHE · submitted 2018-12-04 · cs.SI · stat.AP

Understanding Information Centrality Metric: A Simulation Approach

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:YXNTOBHErecord.jsonopen to challenge →

classification cs.SI stat.AP
keywords informationcentralityflownetworkmetricunderstandingclosenesseigenvector
0
0 comments X
read the original abstract

Identifying the central people in information flow networks is essential to understanding how people communicate and coordinate as well as who controls the information flows in the network. However, the appropriate usage of centrality metrics depends on an understanding of the type of network flow. Networks can vary in the way node-to-node transmission takes place, or in the way a course through the network is taken, thereby leading to different types of information flow processes. When metrics are used for an inappropriate flow process, the result of the metric can be misleading and often incorrect. In this paper we create a simulation of the flow of information in a network, and then we investigate the relation of information centrality as well as other network centralities, like betweenness, closeness and eigenvector along with the outcome of simulations with information flowing through walks rather than paths, trails or geodesics. We find that Information Centrality is more similar to Eigenvector and Degree centrality than to Closeness centrality as postulated by previous literature. We also find an interesting pattern emerge from the inter metric correlations.

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.