Abstract
With great theoretical and practical significance, locating influential nodes of complex networks is a promising issue. In this paper, we present a dynamicssensitive (DS) centrality by integrating topological features and dynamical properties. The DS centrality can be directly applied in locating influential spreaders. According to the empirical results on four real networks for both susceptibleinfectedrecovered (SIR) and susceptibleinfected (SI) spreading models, the DS centrality is more accurate than degree, kshell index and eigenvector centrality.
Introduction
Spreading dynamics represents many important processes in nature and society^{1,2}, such as the propagation of computer viruses^{3} and traffic congestion^{4}, reaction diffusion^{5}, spreading of infectious diseases^{6} and cascading failures^{7}. The estimation of nodes’ spreading influences can help in hindering epidemics or accelerating innovation^{8}, and similar methods can be further applied in identifying influential spreaders in social networks^{9}, quantifying the influence of scientists and their publications^{10}, evaluating the impacts of injection points in the diffusion of microfinance^{11}, finding drug targets in directed pathway networks^{12}, predicting essential proteins in protein interaction networks^{13}, and so on.
The significance of this issue triggers a variety of novel approaches in identifying influential spreaders in networks, which can be roughly categorized into three classes. Firstly, some scientists argued that the location of a node is more important than its immediate neighbors, and thus proposed kshell index^{14,15} and its variants^{16,17,18,19} as indicators of spreading influences. Secondly, some scientists quantified a node’s influence only accounting for its local surroundings^{20,21,22}. Thirdly, some scientists evaluated nodes’ influences according to the steady states of some introduced dynamical processes, such as random walk^{23,24} and iterative refinement^{25}.
The abovementioned approaches only take into account the topological features, while recent experiments indicate that the performance of structural indices is very sensitive to the specific dynamics on networks^{26,27,28}. For example, when the spreading rate is very small, the degree usually performs better than the eigenvector centrality^{29} and kshell index^{14}, while when the infectivity is very high, the eigenvector centrality is the best one among the three (see Figs 1 and 2, with details shown later). To the best of our knowledge, there are few works taking into account the properties of the underlying spreading dynamics^{30,31,32}. Encoding the interplay between topology and dynamics, Klemm et al.^{30} suggested that the eigenvector centrality can be used in estimating nodes’ dynamical influences in the susceptibleinfectedrecovered (SIR) spreading model (also called susceptibleinfectedremoved model)^{33}. Li et al.^{31} provided complementary explanation of the suitability of eigenvector centrality based on perturbation around the equilibrium of the epidemic dynamics and discussed the limitations of eigenvector centrality for homogeneous community networks. Both the above two works did not pay enough attention to the specific parameters in the spreading models, and thus their suggested index only works well in a limited range of the parameter space. Bauer and Lizier^{32} proposed an approach based on counting the number of possible infection walks with different lengths to approximate the number of infected nodes generated by a given initially infected node. Their method is an effective one to predict the outbreak size over a wide range of spreading rate but less efficient due to the considerable computational cost. In addition, for the fundamental complexity in counting the number of paths connecting two nodes, their method could not be formulated in a compact analytical form.
In this paper, we describe the infectious probabilities of nodes by a matrix differential function that accounts both topological features and dynamical properties. Accordingly, we propose a dynamicssensitive (DS) centrality to predict the outbreak size at given time step, which can be directly applied in quantifying the spreading influences of nodes. According to the empirical results on four real networks, for both the SIR model^{33} and the susceptibleinfected (SI) model^{34,35}, the DS centrality can locate influential nodes accurately and performs particularly well in the early stage of spreading. The method proposed in this paper can be extended to other Markov processes on networks.
DynamicsSensitive Centrality
A simple undirected connected network G = (V, E) with nodes and links could be described by an adjacency matrix where a_{ij} = 1 if node i is connected with node j, and a_{ij} = 0 otherwise. A is binary and symmetric with zeros along the main diagonal, and thus its eigenvalues are real and can be arrayed in a descending order as . Since A is a symmetric and realvalued matrix, it can be factorized as , where , and q_{i} is the eigenvector of the eigenvalue λ_{i}.
We consider a discretetime spreading model where an infected node would infect its neighbors with spreading rate β and recover with recovering rate μ (see Materials and Methods for details). Denote x(t) (t > 0) as an approximation of the cumulative probabilities that nodes are excited between time step 1 and t, and then x(t) − x(t − 1) (t > 1) is approximated as the probabilities of nodes to be infected at time step t. If i is the only initially infected node, then x_{i}(0) = 1 and x_{j≠i}(0) = 0. In the first time step, x(1) = β Ax(0), and for t > 1, we have (see the derivation in Materials and Methods)
where I is the identity matrix. Denoting , then represents the probabilities of nodes to be infected at time step t, and thus the cumulative probabilities of nodes to have been infected between time step 1 and t can be approximated as
We define S_{i}(t) to be the spreading influence of node i at time step t, which can be quantified by the sum of infected probabilities of all nodes, given i the initially infected seed. According to Eq. (2), the infected probabilities can be written as
where e_{i} = (0, …, 0, 1, 0, …, 0)^{T} is an n × 1 vector with only the ith element being 1. As all elements other than the ith one of e_{i} are zero, x(t) is indeed the sum of all the ith columns of . Given x(0) = e_{i}, S_{i}(t) is defined as the sum of all elements of x(t), which is equal to the sum of all elements in the ith columns of , as
where L = (1, 1, …, 1)^{T} is an n × 1 vector whose components are all 1. Obviously, A^{T} = A, H^{T} = H and AH = HA, so the spreading influence of all nodes can be described by the vector
Notice that, , and is the infected probabilities of all nodes given node i the only initially infected seed according to Eq. (2), so S(t) can also be roughly explained as the sum of infected probabilities over the n cases with every node being the infected seed once. This relationship shows an underlying symmetry, that is, in an undirected network, the node having higher influence is also the one apt to be infected. The readers are warned that such conclusion is not mathematically rigorous since we have ignored the complicated entanglement by allowing the elements of x(t) being larger than 1.
The eigenvectors of H are the same to the ones of A and βλ_{i} + 1 − μ is the ith eigenvalue of H, corresponding to q_{i}. When βλ_{1} + 1 − μ < 1, i.e. β/μ < 1/λ_{1} (for the case μ ≠ 0), H^{t}L could converge to null vector when t→∞ and S(t) could be written by the following way
For simplicity, in the SIR model, we set μ = 1, and then
where (A^{t}L)_{i} counts the total number of walks of length t from node i to all nodes in the network, weighted by β^{t} that decays as the increase of the length t. As S(t) quantifies nodes’ spreading influences, we call it dynamicssensitive (DS) centrality, where the term dynamicssensitive emphasizes the fact that S(t) is determined not only by the network structure (i.e., A), but also the dynamical parameters (i.e., β and t). In particular, when t = 1, the initially infected node only has the chance to infect its neighbors and S_{i}(1) = (β AL)_{i} with (AL)_{i} being exactly the degree of node i. When μ = 0 (corresponding to the SI model) or β ≥ 1/λ_{1}, S(t) would be infinite when t→∞, which could not reflect the spreading influences. In fact, there are two underlying assumptions. Firstly, the DS centrality calculates the probabilities of the nodes to be infected at time step t by linear coupling instead of nonlinear coupling. For example, if a susceptible node has m infected neighbors, the probability of the node to be infected is approximated as mβ by the DS centrality, instead of 1 − (1 − β)^{m}, which is the exact probability of the node to be infected. Secondly, the DS centrality calculates the probabilities of nodes to be infected under the assumption that the nodes are susceptible at time steps t. Notice that, our main goal is to find out the ranking of spreading influences of nodes, namely to identify influential nodes. As every node’s infected probability is overestimated, the ranking may be less affected. Thus far, we are still not aware of the impacts on the ranking, while fortunately, as later indicated by the extensive numerical results, the DS centrality performs much better than other wellknown indices for a very broad ranges of β and t that cover most practical scenarios.
Results
We test the performance of DS centrality in evaluating the nodes’ spreading influences according to the SIR model and SI model, with varying spreading rate β. Four real networks, including a scientific collaboration network, an email communication network, the Internet at the router level and a proteinprotein interaction network, are used for the empirical analysis (see data description in Materials and Methods), and three wellknown indices, including degree, kshell index and eigenvector centrality, are used as benchmark methods for comparison (see Materials and Methods for the definitions of those indices). Given the time step t, the spreading influence of an arbitrary node i is quantified by the number of infected nodes (for SI model) or the number of infected and recovered nodes (for SIR model) at t, where the spreading process starts with only node i being initially infected. Here we use Kendall’s Tau τ^{36} to measure the correlation between nodes’ spreading influences and the considered centrality measure, where τ is in the range [−1, 1] and the larger τ corresponds to the better performance (see Materials and Methods for the definition of τ).
As shown in Fig. 1, the Kendall’s Tau τ for the DS centrality is between 0.968 and 0.995 for , indicating that the ranking lists generated by the DS centrality and the real SIR spreading process are highly identical to each other. In comparison, the DS centrality performs better than degree, kshell index and eigenvector centrality since the DS centrality takes into account one more parameter β. As shown in Fig. 2, similar results are also observed for the SI model where the DS centrality performs better than others. The results for larger β and t are respectively shown in Figs S1 and S2 of Supplementary Information, where the DS centrality still could locate influential nodes accurately. Meanwhile, Fig. S3 shows that the DS centrality also performs much better than other compared indices in evaluating the nodes’ spreading influences for μ = 0.3 and 0.7 in the SIR model.
Since A is a symmetric, realvalued matrix, the DS centrality S(t) can be written in the following way by decomposing A
where for 1 ≤ r ≤ n. Rewriting Eq. (8) into
With the increase of t and β, will converge to 0, and thus the ranking lists generated by S(t) will be identical to q_{1}, which is exactly the same to the eigenvector centrality. This relationship is in accordance with the results presented in Figs S1 and S2, where the difference between the eigenvector centrality and DS centrality gets smaller as the increase of β and t.
Conclusion and Discussions
Estimating the spreading influences and then identifying influential nodes are fundamental task before any regulation on the spreading process. For such task, most known works only took into account the topological information^{8}. Recently, Aral and Walker^{37} showed that the attributes of nodes are highly correlated with nodes’ influences and tendencies to be influenced. In this paper, in addition to the topological information, we get down to the underlying spreading dynamics and propose a dynamicssensitive (DS) centrality, which is a kind of weighted sum of walks ending at the target node, where both the spreading rate and spreading time are accounted in the weighting function. The DS centrality can be directly applied in quantifying the spreading influences of nodes. According to the empirical analyses of the SIR model and SI model at given time step on four real networks, the DS centrality can locate influential nodes much more accurately than degree, kshell index and eigenvector centrality. In fact, it is unfair to directly compare the DS centrality with the above structurebased indices since the DS centrality takes into account one more parameter β, while the present result is still significant as it gives an elegant way to account the specific dynamics and shows the remarkable improvement by introducing the parameter β, which may be expected but not yet well demonstrated before this paper.
The DS centrality performs particularly well in the early stage of spreading, which provides a powerful tool in early detection of potential superspreaders for epidemic control. Notice that, we did not consider the asymptotical case with t→∞, since after sufficiently long spreading time, all nodes in the network would be infected under large spreading rate, especially in the SI model. In such case, different nodes spreading influences are not distinguishable.
The DS centrality tells us an often ignored fact that the most influential nodes are dependent not only on the network topology but also on the spreading dynamics. Given different models and parameters, the relative influences of nodes are also different. Roughly speaking, if the spreading rate is small, we can focus on the close neighborhood of a node since it is not easy to form a long spreading pathway (i.e., β^{t} decays very fast as the increase of t when β is small) while if the spreading rate is high, the global topology should be considered. A clear limitation of this work is that before calculating the DS centrality, we have to know the spreading rate that is usually a hidden parameter. This parameter can be effectively estimated according to the early spreading process^{38} and then we can calculate the DS centralities by varying the spreading rates over the estimated range and see which nodes are the most influential ones in average. In addition to the identification of the most influential node, a related but more challenging problem is to find the most influential sets of nodes^{39}. The DS centrality could not be directly extended to solve this problem, however, similar to the present idea, the dynamical information is very necessary in dealing with this problem^{40}.
Some other centralities related to specific dynamical processes have also been proposed recently, including routing centrality^{41}, epidemic centrality^{42}, diffusion centrality^{43}, percolation centrality^{44} and game centrality^{45}. Comparing with these centralities, similar to the works by Klemm et al.^{30,46,47}, this paper provides a more general framework that could deal with other Markov processes and thus can be extended and applied in many other important dynamics, such as the Ising model^{48}, Boolean dynamics^{49}, voter model^{50}, synchronization^{51}, and so on. For example, Zhou et al.^{35} considered a variant SIR spreading model where an infected node can only contact one neighbor in one time step. In this case, the adjacency matrix A in the DS centrality could be replaced by D^{−1} A, where D is an n × n matrix where ith main diagonal element is the degree of node i and other elements are 0. Then the DS centrality can be extended to this spreading model. Furthermore, the DS centrality can also be directly extended to asymmetrical networks and weighted networks. We hope this work could highlight the significant role of underlying dynamics in quantifying the individual nodes’ importance, and then the difference between lists of critical nodes for different dynamical processes could be considered as their distinguished properties.
Materials and Methods
Derivation of Eq. (1)
The probabilities of nodes to be infected at time step t = 2 can be approximated as
where x(1) + (1 − μ)x(0) is the probabilities that nodes still have the ability to infect the susceptible nodes at time step 2. We assume that when t ≤ p, , then for t = p + 1, we have
where is the probabilities that nodes still have the ability to infect the susceptible nodes at time step p + 1. Therefore, we can get that
Therefore, according to the mathematical induction, Eq. (1) is established.
Spreading Model
Here we apply the susceptibleinfectedrecovered (SIR) model (also called the susceptibleinfectedremoved model)^{33}. In the SIR model, there are three kinds of individuals: (i) susceptible individuals that could be infected, (ii) infected individuals having been infected and being able to infect susceptible individuals, and (iii) recovered individuals that have been recovered and will never be infected again. In this paper, the spreading process starts with only one seed node being infected initially, and all other nodes are initially susceptible. At each time step, each infected node makes contact with its neighbors and each susceptible neighbor is infected with a probability β. Then each infected node enters the recovered state with a probability μ. In the main text we set μ = 1, and for other values of μ, the results are very similar (see SI). In the standard SI model, nodes can only be susceptible or infected, corresponding to the case with μ = 0. In this paper, the model, analysis and simulations are all based on the discretetime dynamics.
Benchmark Methods
The degree of an arbitrary node i is defined as the number of its neighbors, namely
where a_{ij} is the element of matrix A. Degree centrality is widely applied for its simplicity and low computational cost, which works especially well in evaluating nodes’ spreading influences when the spreading rate is small.
The main idea of eigenvector centrality is that a node’s importance is not only determined by itself, but also affected by its neighbors’ importance^{29}. Accordingly, eigenvector centrality of node i, v_{i}, is defined as
where λ is a constant. Obviously, Eq. (13) can be written in a compact form as
where . That is to say, v is the eigenvector of the adjacency matrix A and λ is the corresponding eigenvalue. Since the considered network is a simple undirected connected network and thus the adjacency matrix A is irreducible. According to PerronFrobenius Theorem^{52}, the elements in the leading eigenvector are strictly positive. Since the influences of nodes should be strictly positive, v must be the leading eigenvector corresponding to the largest eigenvalue of A, say v = q_{1}.
Kitsak et al.^{14} argued that kshell index (i.e., coreness) is a better index than degree to locate the influential nodes. The kshell can be obtained by the socalled kcore decomposition^{53}. The kcore decomposition process is initiated by removing all nodes with degree k = 1. This causes new nodes with degree k ≤ 1 to appear. These are also removed and the process is continued until all remaining nodes are of degree k > 1. The removed nodes (together with associated links) form the 1shell, and their kshell indices are all one. We next repeat this pruning process for the nodes of degree k = 2 to extract the 2shell, that is, in each step the nodes with degree k ≤ 2 are removed. We continue with the process until we have identified all higherlayer shells and all network nodes have been removed. Then each node i is assigned a kshell index c_{i}.
Kendall’s Tau
For each node i, we denote y_{i} as its spreading influence and z_{i} the target centrality measure (e.g., degree, kshell index, eigenvector centrality and DS centrality), the accuracy of the target centrality in evaluating nodes’ spreading influences can be quantified by the Kendall’s Tau^{36}, as
where sgn(y) is a piecewise function, when y > 0, sgn(y) = +1; y < 0, sgn(y) = −1; when y = 0, sgn(y) = 0. τ measures the correlation between two ranking lists, whose value is in the range [−1, 1] and the larger τ corresponds to the better performance.
Data Description
Four real networks are studied in this paper as follows. (i) Erdös, a scientific collaboration network, where nodes are scientists and edges represent the coauthorships. The data set can be freely downloaded from the web site http://www.p.oakland.edu/enp/thedata/. (ii) Email^{54}, which is the email communication network of University Rovira i Virgili (URV) of Spain, involving faculty members, researchers, technicians, managers, administrators, and graduate students. (iii) Router^{55}, the Internet at the router level, where each node represents a router and an edge represents a connection between two routers. (iv) Protein^{56}, an initial version of a proteomescale map of human binary proteinprotein interaction. Basic statistical properties of the above four networks are presented in Table 1.
Additional Information
How to cite this article: Liu, J.G. et al. Locating influential nodes via dynamicssensitive centrality. Sci. Rep. 6, 21380; doi: 10.1038/srep21380 (2016).
References
Zhou, T., Fu, Z. Q. & Wang, B. H. Epidemic dynamics on complex networks. Porg. Nat. Sci. 16, 452 (2006).
PastorSatorras, R., Castellano, C., Van Mieghem, P. & Vespignani, A. Epidemic processes in complex networks. Rev. Mod. Phys. 87, 925 (2015).
Kephart, J. O., Sorkin, G. B., Chess, D. M. & White, S. R. Fighting computer viruses. Sci. Am. 277, 56 (1997).
Li, D. et al. Percolation transition in dynamical traffic network with evolving critical bottlenecks. Proc. Nat. Acad. Sci. USA 112, 69 (2015).
Colizza, V., PastorSatorras, R. & Vespignani, A. Reactiondiffusion processes and metapopulation models in heterogeneous networks. Nat. Phys. 3, 276 (2007).
Keeling, M. J. & Rohani, P. Modeling Infectious Diseases in Humans and Animals. Princeton University Press, Princeton (2008).
Motter, A. E. Cascade control and defense in complex networks. Phys. Rev. Lett. 93, 098701 (2004).
Pei, S. & Makse, H. A. Spreading dynamics in complex networks. Journal of Statistical Mechanics: Theory and Experiment 2013, P12002 (2013).
GonzálezBailón, S., BorgeHolthoefer, J., Rivero, A. & Moreno, Y. The dynamics of protest recruitment through an online network. Sci. Rep. 1, 197 (2011).
Zhou, Y. B., Lü, L. & Li, M. Quantifying the influence of scientists and their publications: distinguishing between prestige and popularity. New. J. Phys. 14, 033033 (2012).
Banerjee, A., Chandrasekhar, A. G., Duflo, E. & Jackson, M. O. The diffusion of microfinance. Science 341, 1236498 (2013).
Csermely, P., Korcsmáros, T., Kiss, H. J., London, G. & Nussinov, R. Structure and dynamics of molecular networks: a novel paradigm of drug discovery: a comprehensive review. Pharmacol. Ther. 138, 333 (2013).
Li, M., Zhang, H., Wang, J. X. & Pan, Y. A new essential protein discovery method based on the integration of proteinprotein interaction and gene expression data. BMC Syst. Biol. 6, 15 (2012).
Kitsak, M. et al. Identification of influential spreaders in complex networks. Nat. Phys. 6, 888 (2010).
Castellano, C. & PastorSatorras, R. Competing activation mechanisms in epidemics on networks. Sci. Rep. 2, 371 (2012).
Zeng, A. & Zhang, C. J. Ranking spreaders by decomposing complex networks. Phys. Lett. A 377, 1031 (2013).
Liu, J. G., Ren, Z. M. & Guo, Q. Ranking the spreading influence in complex networks. Physica A 392, 4154 (2013).
Lin, J. H., Guo, Q., Dong, W. Z., Tang, L. Y. & Liu, J. G. Identifying the node spreading influence with largest kcore values. Phys. Lett. A 378, 3279 (2014).
Liu, Y., Tang, M., Zhou, T. & Do, Y. Improving the accuracy of the kshell method by removing redundant links: From a perspective of spreading dynamics. Sci. Rep. 5, 13172 (2015).
Chen, D. B., Lü, L., Shang, M. S., Zhang, Y. C. & Zhou, T. Identifying influential nodes in complex networks. Physica A 391, 1777 (2012).
Chen, D. B., Gao, H., Lü, L. & Zhou, T. Identifying influential nodes in largescale directed networks: the role of clustering. PLoS ONE 8, e77455 (2013).
Pei, S., Muchnik, L., Andrade, J. S., Jr., Zheng, Z. & Makse, H. A. Searching for superspreaders of information in realworld social media. Sci. Rep. 4, 5547 (2014).
Lü, L., Yeung, C. H., Zhang, Y. C. & Zhou, T. Leaders in social networks, the delicious case. PLoS ONE 6, e21202 (2011).
Li, Q., Zhou, T., Lü, L. & Chen, D. B. Identifying influential spreaders by weighted LeaderRank. Physica A 404, 47 (2014).
Ren, Z. M., Zeng, A., Chen, D. B., Liao, H. & Liu, J. G. Iterative resource allocation for ranking spreaders in complex networks. EPL 106, 48005 (2014).
BorgeHolthoefer, J., Rivero, A. & Moreno, Y. Locating privileged spreaders on an online social network. Phys. Rew. E 85, 066123 (2012).
BorgeHolthoefer, J. & Moreno, Y. Absence of influential spreaders in rumor dynamics. Phys. Rew. E 85, 026116 (2012).
Liu, Y., Tang, M., Zhou, T. & Do, Y. Corelike groups resulting in invalidation of kshell decomposition analysis. Sci. Rep. 5, 9602 (2015).
Borgatti, S. P. Centrality and network flow. Soc. Netw. 27, 55 (2005).
Klemm, K., Serrano, M. A., Eguiluz, V. M. & San Miguel, M. A measure of individual role in collective dynamics. Sci. Rep. 2, 292 (2012).
Li, P., Zhang, J., Xu, X. K. & Small M. Dynamical influence of node revisited: a markov chain analysis of epidemic process on networks. Chin. Phys. Lett. 29, 048903 (2012).
Bauer, F. & Lizier, J. T. Identifying influential spreaders and efficiently estimating infection numbers in epidemic models: a walk counting approache. EPL 99, 68007 (2012).
Hethcote, H. W. The mathematics of infectious diseases. SIAM Rev. 42, 599 (2000).
Barthélemy, M., Barrat, A., PastorSatorras, R. & Vespignani, A. Velocity and hierarchical spread of epidemic outbreaks in scalefree networks. Phys. Rev. Lett. 92, 178701 (2004).
Zhou, T., Liu, J. G., Bai, W. J., Chen, G. & Wang, B. H. Behaviors of susceptibleinfected epidemics on scalefree networks with identical infectivity. Phys. Rev. E 74, 056109 (2006).
Kendall, M. G. A new measure of rank correlation. Biometrika 30, 81 (1938).
Aral, S. & Walker, D. Identifying influential and susceptible members of social networks. Science 68, 337 (2012).
Chen, D. B., Xiao, R. & Zeng, A. Predicting the evolution of spreading on complex networks. Sci. Rep. 4, 6108 (2014).
Kempe, D., Kleinberg, J. & Tardosé, É. Maximizing the spread of influence through a social network. Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 137–146, AAAI Press, 2015).
Morone, F. & Makse, H. A. Influence maximization in complex networks through optimal percolation. Nature 524, 65 (2015).
Dolev, S., Elovici, Y. & Puzis, R. Routing betweenness centrality. J. ACM 57(4), 25 (2010).
Šikić, M., Lančić, A., AntulovFantulin, N. & Štefančić, H. Epidemic centrality – is there an underestimated epidemic impact of network peripheral nodes? Eur. Phys. J. B 86, 440 (2013).
Ide, K., Zamami, R. & Namatame, A. Diffusion Centrality in Interconnected Networks. Proc. Comput. Sci. 24, 227 (2013).
Piraveenan, M., Prokopenko, M. & Hossain, L. Percolation centrality: Quantifying graphtheoretic impact of nodes during percolation in networks. PLoS One 8, e53095 (2013).
Simko, G. I. & Csermely, P. Nodes having a major influence to break cooperation define a novel centrality measure: game centrality. PLoS One 8, e67159 (2013).
Ghanbarnejad, F. & Klemm, K. Impact of individual nodes in Boolean network dynamics. EPL 99, 58006 (2012).
Klemm, K. Searchability of Central Nodes in Networks. J. Stat. Phys. 151, 707 (2013).
Dorogovtsev, S. N., Goltsev, A. V. & Mendes, J. F. Critical phenomena in complex networks. Rev. Mod. Phys. 80, 1275 (2008).
Kauffman, S. A. The Origins of Order. Oxford University Press, New York, 1993.
Castellano, C., Fortunato, S. & Loreto, V. Statistical physics of social dynamics. Rev. Mod. Phys. 81, 591 (2009).
Arenas, A., DíazGuilera, A., Kurths, J., Moreno, Y. & Zhou, C. Synchronization in complex networks. Phys. Rep. 469 93 (2008).
Hom, R. A. & Johnson, C. R. Matrix Analysis. Cambridge University Press, Cambridge (1985).
Seidman, S. B. Network structure and minimum degree. Soc. Net. 5, 269 (1983).
Guimera, R., Danon, L., DiazGuilera, A., Giralt, F. & Arenas, A. Selfsimilar community structure in a network of human interactions. Phys. Rew. E 68, 065103 (2003).
Rossi, R. A. & Ahmed, N. K. The Network Data Repository with Interactive Graph Analytics and Visualization. Proceedings of the TwentyNinth AAAI Conference on Artificial Intelligence (AAAI Press, 2015).
Rual, J. F. et al. Towards a proteomescale map of the human proteinprotein interaction network. Nature 437, 1173 (2005).
Acknowledgements
The authors acknowledge the valuable discussion with WenXu Wang and Liming Pan, as well as the Erdös Number Project in Oakland University for the data set. This work is supported by the National Natural Science Foundation of China (Nos 71171136, 61374177, 11222543 and 61433014), JGL is supported by the Program for Professor of Special Appointment (Eastern Scholar) at Shanghai Institutions of Higher Learning and the Shuguang Program Project of Shanghai Educational Committee (Grant No. 14SG42).
Author information
Affiliations
Contributions
J.G.L., J.H.L. and T.Z. designed research, J.G.L., J.H.L. and Q.G. perform research, J.G.L., J.H.L. and T.Z. analysed data, and J.G.L., J.H.L., Q.G. and T.Z. wrote the paper.
Corresponding authors
Ethics declarations
Competing interests
The authors declare no competing financial interests.
Supplementary information
Rights and permissions
This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/
About this article
Cite this article
Liu, JG., Lin, JH., Guo, Q. et al. Locating influential nodes via dynamicssensitive centrality. Sci Rep 6, 21380 (2016). https://doi.org/10.1038/srep21380
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/srep21380
Further reading

Influence control method on directed weighted signed graphs with deterministic causality
Annals of Operations Research (2022)

UACD: A Local Approach for Identifying the Most Influential Spreaders in Twitter in a Distributed Environment
Social Network Analysis and Mining (2022)

Identifying critical nodes in temporal networks by network embedding
Scientific Reports (2020)

Identifying vital nodes in complex networks by adjacency information entropy
Scientific Reports (2020)

Identifying influential spreaders by gravity model
Scientific Reports (2019)
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.