Multimedia Tools and Applications

, Volume 75, Issue 15, pp 8829–8841 | Cite as

Effectively identifying the influential spreaders in large-scale social networks

  • Yingjie XiaEmail author
  • Xiaolong Ren
  • Zhengchao Peng
  • Jianlin Zhang
  • Li She


With great theoretical and practical significance, the studies of information spreading on social media become one of the most exciting domains in many branches of sciences. How to control the spreading process is of particular interests, where the identification of the most influential nodes in larger-scale social networks is a crucial issue. Degree centrality is one of the simplest method which supposes that the node with more neighbours may be more influential. K-shell decomposition method partitions the networks into several shells based on the assumption that nodes in the same shell have similar influence and nodes in higher-level shells (e.g., central) are probably to infect more nodes. Degree centrality and k-shell decomposition are local methods which are efficient but less relevant. Global methods such as closeness and betweenness centralities are more exact but time-consuming. For effectively identifying the more influential spreaders in large-scale social networks, in this paper we proposed an algorithm framework to solve this dilemma by combining the local and global methods. All the nodes are graded by the local methods and then the periphery of the network is removed according to their central values. At last, the global methods are employed to find out which node is more influential. The experimental results show that our framework can be efficient and even more accurate than the global methods


Important nodes Node centrality Node ranking Large-scale networks 



This paper draws on work supported in part by the following funds: National Natural Science Foundation of China under grant number 61472113, 61304188 and 11205042, Zhejiang Provincial Natural Science Foundation of China under grant number LZ13F020004, LR14F020003 and Y6110317, and CCF-Tencent Open Research Fund.


  1. 1.
    Albert R, Jeong H, Barabsi AL (2000) Error and attack tolerance of complex networks. Nature 406:378–82CrossRefGoogle Scholar
  2. 2.
    Barabsi AL, Albert R (1999) Emergence of scaling in random networks. Science 286:509–12MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Barrat A, Barthelemy M, Pastor-Satorras R, Vespignani A (2004) The architecture of complex weighted networks. Proc Natl Acad Sci USA 101:3747–52CrossRefGoogle Scholar
  4. 4.
    Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang D-U (2006) Complex networks: structure and dynamics. Phys Rep 424:175–308MathSciNetCrossRefGoogle Scholar
  5. 5.
    Chen D, Lü L, Shang MS, Zhang YC, Zhou T (2012) Identifying influential nodes in complex networks. Physica A: Statistical Mechanics and its Applications 391:1777–87CrossRefGoogle Scholar
  6. 6.
    Duke CB, Hopcroft JE, Arkin AP, Armstrong RE, Barabsi AL, Brachman RJ, Broome NL, Davis S, Millo RAD, Hilsman WJ (2007) Network science, Committee on network science for future army applications. The National Academies Press, Washington, DCGoogle Scholar
  7. 7.
    Frasco GF, Sun J, Rozenfeld HD, ben-Avraham D (2004) Spatially distributed social complex networks. Phys Rev X 4:011008Google Scholar
  8. 8.
    Gao Y, Wang M, Tao DC, Ji RR, Dai QH (2012) 3D object retrieval and recognition with hypergraph analysis, IEEE Transactions on Image Processing, 21(9):4290-4303Google Scholar
  9. 9.
    Gao Y, Wang M, Zha ZJ, Shen JL, Li XL, Wu XD (2013) Visual-Textual joint relevance learning for Tag-based social image search, IEEE Transactions on Image Processing, 22(1):363–376Google Scholar
  10. 10.
    Garas A, Schweitzer F, Havlin S (2012) A k-shell decomposition method for weighted networks. New J Phys 14:083030CrossRefGoogle Scholar
  11. 11.
    Gjoka M, Kurant M, Butts CT, Markopoulou A (2010). Walking in facebook: a case study of unbiased sampling of Osns, in INFOCOM, 2010 Proceedings IEEE, IEEE, 1–9Google Scholar
  12. 12.
    Guimera R, Danon L, Diaz-Guilera A, Giralt F, Arenas A (2003) Self-similar community structure in a network of human interactions. Phys Rev E 68:065103CrossRefGoogle Scholar
  13. 13.
    Guimer R, Das-Guilera A, Vega-Redondo F, Cabrales A, Arenas A (2002) Optimal network topologies for local search with congestion. Phys Rev Lett 89:248701CrossRefGoogle Scholar
  14. 14.
    Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6:888–93CrossRefGoogle Scholar
  15. 15.
    Kumar R, Novak J, Tomkins A (2012) Structure and evolution of online social networks, Link mining: models, algorithms, and applications. Springer, pp 337–57Google Scholar
  16. 16.
    Lü L, Lu JA, Zhang ZK, Yan XY, Wu Y, Shi DH, Zhou HP, Fang JQ, Zhou T (2010) Look into complex netwoks(in Chinese). Complex systems and complexity science 7(2–3):173–186Google Scholar
  17. 17.
    Lü L, Zhang YC, Yeung CH, Zhou T (2011) Leaders in social networks, the delicious case. PLoS ONE 6:e21202CrossRefGoogle Scholar
  18. 18.
    McAuley JJ, Leskovec J (2012) Learning to discover social circles in ego networks. NIPS 2012:548–56Google Scholar
  19. 19.
    Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298:824–27CrossRefGoogle Scholar
  20. 20.
    Newman M (2009) Networks: an introduction, 387. Oxford University PressGoogle Scholar
  21. 21.
    Newman M (2003) The structure and function of complex networks. SIAM Rev 45:167–256MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Ren X, Lü L (2014) Review of ranking nodes in complex networks(in Chinese). Chin Sci Bull 59:1–23CrossRefGoogle Scholar
  23. 23.
    Rombach MP, Porter MA, Fowler JH, Mucha PJ (2012) Core-periphery structure in networks. arXiv:1202.2684
  24. 24.
    Sparrowe RT, Liden RC, Wayne SJ, Kraimer ML (2001) Social networks and the performance of individuals and groups. Acad Manag J 44:316–25CrossRefGoogle Scholar
  25. 25.
    Watts DJ, Strogatz SH (1998) Collective dynamics of small-sorld networks. Nature 393:440–42CrossRefGoogle Scholar
  26. 26.
    Xia YJ, Zhou YZ (2014) Synchronization induced by disorder of phase directions. International Journal of Modern Physics C, 25(05)Google Scholar
  27. 27.
    Yang Y, Gao Y, Zhang HW, Shao J, Chua T-S (2014). Image Tagging with Social Assistance, ACM International Conference on Multimedia Retrieval, 81Google Scholar
  28. 28.
    Yang Y, Shen HT, Zhang YC, Du XY, Zhou XF (2013) IEEE Transactions on Data and Knowledge Engineering 25:1760–1771Google Scholar
  29. 29.
    Yang Y, Yang Y, Shen HT (2013) Effective transfer tagging from image to video. ACM Transactions on Multimedia Computing, Communications and Applications 9:14:1–14:20Google Scholar
  30. 30.
    Yang Y, Zha ZJ, Gao Y, Zhu X, Chua T-S (2014). Exploiting Web Images for Robust Semantic Video Indexing via Sample-specific Loss, IEEE Transactions on MultimediaGoogle Scholar
  31. 31.
    Zhang LM, Song ML, Li N, Bu JJ, Chen C (2012) Feature selection for fast speech emotion recognition, ACM Multimedia (MM short paper), pp 753–756Google Scholar
  32. 32.
    Zhang LM, Song ML, Zhao Q, Liu X, Bu JJ, Chen C (2013) Probabilistic graphlet transfer for photo cropping, IEEE Transactions on Image Processing 22(2): 802–815Google Scholar
  33. 33.
    Zhou YZ, Xia YJ (2014) Epidemic spreading on weighted adaptive networks. Physica A: Statistical Mechanics and its Applications, 399:16–23Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Yingjie Xia
    • 1
    Email author
  • Xiaolong Ren
    • 2
  • Zhengchao Peng
    • 3
  • Jianlin Zhang
    • 2
  • Li She
    • 2
  1. 1.Intelligent Transportation and Information Security LabHangzhou Normal UniversityZhejiangChina
  2. 2.Alibaba Research Center for Complexity Sciences, Alibaba Business CollegeHangzhou Normal UniversityZhejiangChina
  3. 3.Web Sciences CenterUniversity of Electronic Science and Technology of ChinaSichuanChina

Personalised recommendations