A novel weight neighborhood centrality algorithm for identifying influential spreaders in complex networks

Physica A: Statistical Mechanics and its Applications

Volumn 475, Issue , 2017, Pages 88-105

  Wang, Junyi ^a   Hou, Xiaoni ^a   Li, Kezan ^a   Ding, Yong ^a  

^a GUILIN UNIVERSITY OF ELECTRONIC TECHNOLOGY   (China)

Author keywords

Complex network; SIR epidemic model; Spreading ability; Weight neighborhood centrality

Indexed keywords

EPIDEMIOLOGY; INFORMATION DISSEMINATION; SPREADERS;

ARTIFICIAL NETWORKS; CENTRALITY MEASURES; HIGH COMPUTATION EFFICIENCY; LARGE-SCALE NETWORK; REAL-WORLD NETWORKS; SIR EPIDEMIC MODEL; SPREADING ABILITIES; WEIGHT NEIGHBORHOOD CENTRALITY;

COMPLEX NETWORKS;

EID: 85013178185     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2017.02.007     Document Type: Article

References (49)

1. [1] Kitsak, M., Gallos, L.K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H.E., Makse, H.A., Identification of influential spreaders in complex networks. Nat. Phys. 6:11 (2010), 888–893, 10.1038/nphys1746.
2. [2] Klemm, K., Ángeles Serrano, M., Eguíluz, V.M., Miguel, M.S., A measure of individual role in collective dynamics. Sci. Rep., 2, 2012, 292, 10.1038/srep00292.
3. [3] Castellano, C., Pastor-Satorras, R., Competing activation mechanisms in epidemics on networks. Sci. Rep., 2, 2012, 371, 10.1038/srep00371.
4. [4] Zhou, T., Liu, J.-G., Bai, W.-J., Chen, G., Wang, B.-H., Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity. Phys. Rev. E, 74(5), 2006, 056109.
5. [5] Kephart, J.O., Sorkin, G.B., Fighting computer viruses. Sci. Am. 277:5 (1997), 88–93.
6. [6] Colizza, V., Pastor-Satorras, R., Vespignani, A., Reaction diffusion processes and metapopulation models in heterogeneous networks. Nat. Phys. 3:4 (2007), 276–282, 10.1038/nphys560.
7. [7] Pastor-Satorras, R., Vázquez, A., Vespignani, A., Dynamical and correlation properties of the Internet. Phys. Rev. Lett., 87(25), 2001, 258701, 10.1103/PhysRevLett.87.258701.
8. [8] Motter, A.E., Cascade control and defense in complex networks. Phys. Rev. Lett., 93(9), 2004, 098701, 10.1103/PhysRevLett.93.098701.
9. [9] Wang, Z., Szolnoki, A., Perc, M., Interdependent network reciprocity in evolutionary games. Sci. Rep., 3, 2013, 1183, 10.1038/srep01183.
10. [10] Wang, Z., Szolnoki, A., Perc, M., Optimal interdependence between networks for the evolution of cooperation. Sci. Rep., 3, 2013, 2470, 10.1038/srep02470.
11. [11] Chen, D., Lü, L., Shang, M.-S., Zhang, Y.-C., Zhou, T., Identifying influential nodes in complex networks. Physica A 391:4 (2012), 1777–1787, 10.1016/j.physa.2011.09.017.
12. [12] Zeng, A., Zhang, C.-J., Ranking spreaders by decomposing complex networks. Phys. Lett. A 377:14 (2013), 1031–1035, 10.1016/j.physleta.2013.02.039.
13. [13] Liu, J.-G., Ren, Z.-M., Guo, Q., Ranking the spreading influence in complex networks. Physica A 392:18 (2013), 4154–4159, 10.1016/j.physa.2013.04.037.
14. [14] Freeman, L., Centrality in social networks conceptual clarification. Social Networks 1:3 (1979), 215–239.
15. [15] Freeman, L.C., A set of measures of centrality based on betweenness. Sociometry 40:1 (1977), 35–41.
16. [16] Sabidussi, G., The centrality index of a graph. Psychometrika 31:4 (1966), 581–603.
17. [17] Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.F., k-core organization of complex networks. Phys. Rev. Lett., 96, 2006, 040601, 10.1103/PhysRevLett.96.040601.
18. [18] Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y., Shir, E., A model of Internet topology using k-shell decomposition. Proc. Natl. Acad. Sci. USA 104:27 (2007), 11150–11154, 10.1073/pnas.0701175104.
19. [19] Bae, J., Kim, S., Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Physica A 395 (2014), 549–559, 10.1016/j.physa.2013.10.047.
20. [20] Liu, Y., Tang, M., Zhou, T., Do, Y., Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition. Sci. Rep., 5, 2015, 9602, 10.1038/srep09602.
21. [21] Liu, Y., Tang, M., Zhou, T., Do, Y., Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics. Sci. Rep., 5, 2015, 13172, 10.1038/srep13172.
22. [22] Ma, L.-L., Ma, C., Zhang, H.-F., Wang, B.-H., Identifying influential spreaders in complex networks based on gravity formula. Physica A 451 (2016), 205–212, 10.1016/j.physa.2015.12.162.
23. [23] Liu, Y., Tang, M., Zhou, T., Do, Y., Identify influential spreaders in complex networks, the role of neighborhood. Physica A 452 (2016), 289–298, 10.1016/j.physa.2016.02.028.
24. [24] Liu, Y., Wei, B., Du, Y., Xiao, F., Deng, Y., Identifying influential spreaders by weight degree centrality in complex networks. Chaos Solitons Fractals 86 (2016), 1–7, 10.1016/j.chaos.2016.01.030.
25. [25] Brin, S., Page, L., The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30 (1998), 107–117, 10.1016/S0169-7552(98)00110-X.
26. [26] Kleinberg, J.M., Authoritative sources in a hyperlinked environment. J. ACM 46:5 (1999), 604–632, 10.1145/324133.324140.
27. [27] Lü, L., Zhang, Y.-C., Yeung, C.H., Zhou, T., Leaders in social networks, the delicious case. PLoS One, 6(6), 2011, e21202, 10.1371/journal.pone.0021202.
28. [28] Mirzasoleiman, B., Babaei, M., Jalili, M., Safari, M., Cascaded failures in weighted networks. Phys. Rev. E, 84(4), 2011, 046114, 10.1103/PhysRevE.84.046114.
29. [29] Zhang, C.-J., Zeng, A., Network skeleton for synchronization: identifying redundant connections. Physica A 402 (2014), 180–185, 10.1016/j.physa.2014.02.002.
30. [30] Wang, W.-X., Chen, G., Universal robustness characteristic of weighted networks against cascading failure. Phys. Rev. E, 77(2), 2008, 026101, 10.1103/PhysRevE.77.026101.
31. [31] Newman, M.E.J., Spread of epidemic disease on networks. Phys. Rev. E, 66(1), 2002, 016128, 10.1103/PhysRevE.66.016128.
32. [32] Castellano, C., Pastor-Satorras, R., Thresholds for epidemic spreading in networks. Phys. Rev. Lett., 105(21), 2010, 218701, 10.1103/PhysRevLett.105.218701.
33. [33] Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M., The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54:4 (2003), 396–405, 10.1007/s00265-003-0651-y.
34. [34] Newman, M.E.J., Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E, 74(3), 2006, 036104, 10.1103/PhysRevE.74.036104.
35. [35] Guimerà, R., Danon, L., Díaz-Guilera, A., Giralt, F., Arenas, A., Self-similar community structure in a network of human interactions. Phys. Rev. E, 68(6), 2003, 065103, 10.1103/PhysRevE.68.065103.
36. [36] J. Kunegis, Hamsterster full network dataset-KONECT, available at: http://konect.uni-koblenz.de/networks/petster-hamster (accessed: 01.10.15).
37. [37] Leskovec, J., Kleinberg, J., Faloutsos, C., Graph evolution: Densification and shrinking diameters. ACM Trans. Knowl. Discovery Data 1:1 (2007), 1556–4681, 10.1145/1217299.1217301.
38. [38] Boguná, M., Pastor-Satorras, R., Díaz-Guilera, A., Arenas, A., Models of social networks based on social distance attachment. Phys. Rev. E, 70(5), 2004, 056122, 10.1103/PhysRevE.70.056122.
39. [39] Hu, H.-B., Wang, X.-F., Unified index to quantifying heterogeneity of complex networks. Physica A 387:14 (2008), 3769–3780, 10.1016/j.physa.2008.01.113.
40. [40] Newman, M.E.J., Assortative mixing in networks. Phys. Rev. Lett., 89(20), 2002, 208701, 10.1103/PhysRevLett.89.208701.
41. [41] Watts, D.J., Strogatz, S.H., Collective dynamics of small-world networks. Nature 393:6684 (1998), 440–442, 10.1038/30918.
42. [42] Knight, W.R., A computer method for calculating kendalls tau with ungrouped data. J. Amer. Statist. Assoc. 61:314 (1966), 436–439, 10.2307/2282833.
43. [43] Barabási, A.-L., Albert, R., Emergence of scaling in random networks. Science 286:5439 (1999), 509–512, 10.1126/science.286.5439.509.
44. [44] Floyd, R.W., Algortithm 97: shortest path. Commun. ACM, 5(6), 1962, 345, 10.1145/367766.368168.
45. [45] Brandes, U., A faster algorithm for betweenness centrality. J. Math. Sociol. 25:2 (2001), 163–177, 10.1080/0022250X.2001.9990249.
46. [46] Johnson, D.B., Efficient algorithms for shortest paths in sparse networks. J. ACM 24:1 (1977), 1–13, 10.1145/321992.321993.
47. [47] V. Batagelj, M. Zaversnik, An O(m) Algorithm for Cores Decomposition of Networks, arXiv preprint cs/0310049.
48. [48] Chen, J.-C., Zhang, H.-L., Guan, Z.-H., Li, T., Epidemic spreading on networks with overlapping community structure. Physica A 391:4 (2012), 1848–1854, 10.1016/j.physa.2011.10.011.
49. [49] Shang, J.-X., Liu, L.-C., Li, X., Xie, F., Wu, C., Epidemic spreading on complex networks with overlapping and non-overlapping community structure. Physica A 419 (2015), 171–182, 10.1016/j.physa.2014.10.023.