TY - JOUR
T1 - Percolation centrality
T2 - quantifying graph-theoretic impact of nodes during percolation in networks
AU - Piraveenan, Mahendra
AU - Prokopenko, Mikhail
AU - Hossain, Liaquat
PY - 2013/1/29
Y1 - 2013/1/29
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84872804191&partnerID=8YFLogxK
U2 - 10.1371/journal.pone.0053095
DO - 10.1371/journal.pone.0053095
M3 - Article
C2 - 23349699
AN - SCOPUS:84872804191
SN - 1932-6203
VL - 8
SP - 1
EP - 14
JO - PLoS ONE
JF - PLoS ONE
IS - 1
M1 - e53095
ER -