Fast ranking influential nodes in complex networks using a k-shell iteration factor

Physica A: Statistical Mechanics and its Applications

Volumn 461, Issue , 2016, Pages 171-181

  Wang, Zhixiao ^a,b   Zhao, Ya ^a   Xi, Jingke ^a   Du, Changjiang ^a  

^a CHINA UNIVERSITY OF MINING AND TECHNOLOGY   (China)

^b NANJING UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Complex network; Influential node ranking; k shell decomposition; k shell iteration factor

Indexed keywords

EFFICIENCY; INFORMATION DISSEMINATION; ITERATIVE METHODS; SHELLS (STRUCTURES);

INFLUENTIAL NODES; K-SHELLS; MONOTONICITY; NETWORK STRUCTURES; RANKING LISTS; RANKING METHODS; REAL-WORLD NETWORKS;

COMPLEX NETWORKS;

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

References (35)

1. [1] Chen, Duanbing, Lu, Linyuan, Shang, Ming-Sheng, Zhang, Yi-Cheng, Zhou, Tao, Identifying influential nodes in complex networks. Physica A 391 (2012), 1777–1787, 10.1016/j.physa.2011.09.017.
2. [2] Lü, Linyuan, Chen, Duan-Bing, Zhou, Tao, The small world yields the most effective information spreading. New J. Phys., 13(12), 2011, 123005, 10.1088/1367-2630/13/12/123005.
3. [3] Jian-Guo, Liu, Zhuo-Ming, Ren, Qiang, Guo, Bing-Hong, Wang, Node importance ranking of complex networks. Acta Phys. Sinica, 62(17), 2013, 178901, 10.7498/aps.62.178901.
4. [4] Gao, Shui, Ma, Jun, Chen, Zhumin, Wang, Guanghui, Xing, Changming, Ranking the spreading capability of nodes in complex networks based on local structure. Physica A 403 (2014), 130–147, 10.7498/aps.64.020101.
5. [5] Sabidussi, G., The centrality index of a graph. Psychometrika 31:4 (1966), 581–603, 10.1007/BF02289527.
6. [6] Freeman, L.C., Centrality in social networks conceptual clarification. Soc. Netw. 1:3 (1978–1979), 215–239, 10.1016/0378-8733(78)90021-7.
7. [7] Katz, L., A new status index derived from sociometric analysis. Psychometrika 18:1 (1953), 39–43, 10.1007/BF02289026.
8. [8] Borgatti, S.P., Centrality and network flow. Soc. Netw. 27 (2005), 55–71, 10.1016/j.socnet.2004.11.008.
9. [9] Brin, Sergey, Page, Lawrence, The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN 30:1–7 (1998), 107–117, 10.1016/S0169-7552(98)00110-X.
10. [10] Lü, Linyuan, Zhang, Yi-Cheng, Yeung, Chi Ho, Zhou, Tao, Leaders in social networks, the delicious case. PLoS One, 6, 2011, E21202, 10.1371/journal.pone.0021202.
11. [11] Kleinberg, J.M., Authoritative sources in a hyperlinked environment. J. ACM 46:5 (1999), 604–632, 10.1145/324133.324140.
12. [12] Lambiotte, R., Rosvall, M., Ranking and clustering of nodes in networks with smart teleportation. Phys. Rev. E, 85, 2012, 056107, 10.1103/PhysRevE.85.056107.
13. [13] Pei, Sen, Muchnik, Lev, Andrade, Jose S. Jr., Zhang, Zhiming, Makse, Hernan A., Searching for superspreaders of information in real-world social media. Sci. Rep., 4, 2014, 05547, 10.1038/srep05547.
14. [14] Le Merrer, Erwan, Le Scouarnec, Nicolas, Tredan, Gilles, Heuristical top-k: fast estimation of centralities in complex networks. Inform. Process. Lett. 114 (2014), 432–436, 10.1016/j.ipl.2014.03.006.
15. [15] 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.
16. [16] Pei, Sen, Makse, Hernan A., Spreading dynamics in complex networks. J. Stat. Mech. Theory Exp., 12, 2013, P12002, 10.1088/1742-5468/2013/12/P12002.
17. [17] zeng, An, Zhang, Cheng-Jun, Ranking spreaders by decomposing complex networks. Phys. Lett. A 377 (2013), 1031–1035, 10.1016/j.physleta.2013.02.039.
18. [18] Liu, Jian-Guo, Ren, Zhuo-Ming, Guo, Qiang, Ranking the spreading influence in complex networks. Physica A 392:18 (2013), 4154–4159, 10.1016/j.physa.2013.04.037.
19. [19] Zhuo-ming, Ren, Jian-guo, Liu, Feng, Shao, Zhao-long, Hu, Qiang, Guo, Analysis of the spreading influence of the nodes with minimum K-shell value in complex networks. Acta Phys. Sinica, 62(10), 2013, 108902, 10.7498/aps.62.108902.
20. [20] Hou, B., Yao, Y., Liao, D., Identifying all-around nodes for spreading dynamics in complex networks. Physica A 391 (2012), 4012–4017, 10.1016/j.physa.2012.02.033.
21. [21] Fang, Hu, Yuhua, Liu, Multi-index algorithm of identifying important nodes in complex networks based on linear discriminant analysis. Modern Phys. Lett. B, 29(3), 2015, 1450268, 10.1142/S0217984914502686.
22. [22] Bae, Joonhyun, Kim, Sangwook, Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Physica A 395 (2014), 549–559, 10.1016/j.physa.2013.10.047.
23. [23] Morone, Flaviano, Makse, Hernan A., Influence maximization in complex networks through optimal percolation. Nature 524 (2015), 65–68, 10.1038/nature14604.
24. [24] Castellano, C., Pastor-Satorras, R., Thresholds for epidemic spreading in networks. Phys. Rev. Lett., 105(21), 2010, 218701, 10.1103/PhysRevLett.105.218701.
25. [25] Albert, R., Jeong, H., Barabsi, A.L., Error and attack tolerance of complex networks. Nature 406:6794 (2000), 378–382, 10.1038/35019019.
26. [26] Basaras, P., Katsaros, D., Tassiulas, L., Detecting influential spreaders in complex dynamic networks. IEEE Comput. 46:4 (2013), 24–29, 10.1109/MC.2013.75.
27. [27] Lancichinetti, A., Fortunato, S., Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80:1 (2009), 145–148, 10.1103/PhysRevE.80.016118.
28. [28] Zachary, W.W., An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33 (1977), 452–473.
29. [29] 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 (2003), 396–405, 10.1007/s00265-003-0651-y.
30. [30] Gleiser, P., Danon, L., Community structure in Jazz. Adv. Complex Syst., 6(4), 2003, 565, 10.1142/S0219525903001067.
31. [31] 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.
32. [32] Guimera, R., Danon, L., Diaz-Guilera, A., Giralt, F., Arenas, A., Self-similar community structure in a network of human interactions. Phys. Rev. E, 68, 2003, 065103, 10.1103/PhysRevE.68.065103.
33. [33] Xie, N., Social network analysis of blogs. (M.Sc. dissertation), 2006, University of Bristol.
34. [34] Boguna, M., Pastor-Satorras, R., Diaz-Guilera, A., Arenas, A., Models of social networks based on social distance attachment. Phys. Rev. E, 70, 2004, 056122, 10.1103/PhysRevE.70.056122.
35. [35] Leskovec, J., Lang, K., Dasgupta, A., Mahoney, M., Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6:1 (2009), 29–123, 10.1080/15427951.2009.10129177.