Centrality measure in weighted networks based on an amoeboid algorithm

Within network analysis, various measures of node centrality have been developed. In this paper, for weighted networks, a new centrality measure based on an amoeboid algorithm is proposed, which is called Physarum centrality. The measure not only focuses on shortest paths, but also includes contributions from competing paths. With the amoeboid algorithm, each edge is endowed with a flux and edges on shorter paths are of greater flux. By defining flux as criticality of edges, Physarum centrality of a node can be easily calculated as summing up the criticality of edges attached to it. Examples and applications are given to show the effective of our proposed measure in weighted networks. Copyright © 2012 Binary Information Press.