Percolation centrality: quantifying graph-theoretic impact of nodes during percolation in networks.
A number of centrality measures are available to determine the relative importance of a node in a complex network, and betweenness is prominent among them. However, the existing centrality measures are not adequate in network percolation scenarios (such as during infection transmission in a social network of individuals, spreading of computer viruses on computer networks, or transmission of disease over a network of towns) because they do not account for the changing percolation states of individual nodes. We propose a new measure, percolation centrality, that quantifies relative impact of nodes based on their topological connectivity, as well as their percolation states. The measure can be extended to include random walk based definitions, and its computational complexity is shown to be of the same order as that of betweenness centrality. We demonstrate the usage of percolation centrality by applying it to a canonical network as well as simulated and real world scale-free and random networks.
Centre for Complex Systems Research, Faculty of Engineering and IT, The University of Sydney, New South Wales, Australia. mahendrarajah.piraveenan@sydney.edu.au
Mahendra
M
Piraveenan
Mikhail
M
Prokopenko
Liaquat
L
Hossain
D003196:Computer Graphics; D003201:Computers; D008962:Models, Theoretical; D012944:Social Support; D013269:Stochastic Processes