Skip to main content
SpringerLink
Log in

Identifying influential nodes in complex networks based on Neighbours and edges

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

A Correction to this article was published on 05 October 2018

This article has been updated

Abstract

Identifying the influential nodes is one of the research focuses in network information mining. Many centrality measures used to evaluate influence abilities of nodes can’t balance between high accuracy and low time complexity. The NL centrality based on the neighbors and importance of edges is proposed which considers the second-degree neighbor’s impact on the influence of a node and utilizes the connectivity and unsubstitutability of edge to distinguish topological position of a node. In order to evaluate the accuracy of NL centrality, the SIR model is used to simulate the process of virus propagation in four real-world networks. Experiment results of monotonicity, validity and efficiency demonstrate that the NL centrality has a competitive performance in distinguishing the influence of nodes and it is suitable for large-scale networks because of the high efficiency in computation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Change history

  • 05 October 2018

    The article “Identifying influential nodes in complex networks based on Neighbours and edges”, written by Zengzhen Shao, Shulei Liu, Yanyu Zhao, and Yanxiu Liu, was originally published electronically on the publisher’s internet portal (currently SpringerLink) on 19 September 2018 with open access.

References

  1. poDe DM, Solé-Ribalta A, Omodei E, Gómez S, Arenas A (2015) Ranking in interconnected multilayer networks reveals versatile nodes. Nat Commun 6:6868

    Google Scholar 

  2. Sheikhahmadi A, Nematbakhsh MA, Shokrollahi A (2015) Improving detection of influential nodes in complex networks. Physica A 436:833–845

    Google Scholar 

  3. Hinz O, Schulze C, Takac C (2014) New product adoption in social networks: why direction matters. J Bus Res 67(1):2836–2844

    Google Scholar 

  4. Liu JG, Ren ZM, Guo Q, Wang BH (2013) Node importance ranking of complex networks. Acta Phys Sin 62(17):178901–178901

    Google Scholar 

  5. Cai Y, Li Y, Cao Y, Li W, Zeng X (2017) Modeling and impact analysis of interdependent characteristics on cascading failures in smart grids. Int J Electr Power Energy Syst 89:106–114

    Google Scholar 

  6. Mieghem PV, Omic J, Kooij R (2009) Virus spread in networks. IEEE/ACM Trans Networking 17(1):1–14

    Google Scholar 

  7. Lloyd AL, May RM (2001) How viruses spread among computers and people. Science 292(5520):1316–1317

    Google Scholar 

  8. Sporns O (2013) Structure and function of complex brain networks. Dialogues Clin Neurosci 15(3):247–262

    Google Scholar 

  9. Moussa MN, Vechlekar CD, Burdette JH, Steen MR, Hugenschmidt CE, Laurienti PJ (2011) Changes in cognitive state alter human functional brain networks. Front Hum Neurosci 5(12):83

    Google Scholar 

  10. Alvarez MJ, Shen Y, Giorgi FM, Lachmann A, Ding BB, Ye BH (2016) Functional characterization of somatic mutations in cancer using network-based inference of protein activity. Nat Genet 48(8):838–847

    Google Scholar 

  11. Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Networks 1(3):215–239

    Google Scholar 

  12. Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35–41

    Google Scholar 

  13. Sabidussi G (1966) The centrality index of a graph. Psychometrika 31(4):581–603

    MathSciNet  MATH  Google Scholar 

  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(11):888–893

    Google Scholar 

  15. Chen D, Lü L, Shang MS, Zhang YC, Zhou T (2012) Identifying influential nodes in complex networks. Physica A 391(4):1777–1787

    Google Scholar 

  16. Lü L, Chen D, Ren XL, Zhang QM, Zhang YC, Zhou T (2016) Vital nodes identification in complex networks. Phys Rep 650:1–63

    MathSciNet  Google Scholar 

  17. Berahmand K, Bouyer A, Samadi N (2018) A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks. Chaos, Solitons Fractals 110:41–54

    MATH  Google Scholar 

  18. Liu J, Xiong Q, Shi W, Shi X, Wang K (2016) Evaluating the importance of nodes in complex networks. Physica A 452:209–219

    Google Scholar 

  19. Li M, Zhang R, Hu R, Yang F, Yao Y, Yuan Y (2018) Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient. Int J Mod Phys B 32(6):1850118

    MATH  Google Scholar 

  20. Gao S, Ma J, Chen Z, Wang G, Xing C (2014) Ranking the spreading ability of nodes in complex networks based on local structure. Physica A 403(6):130–147

    MATH  Google Scholar 

  21. Wang J, Hou X, Li K, Din Y (2017) A novel weight neighborhood centrality algorithm for identifying influential spreaders in complex networks. Physica A 475:88–105

    Google Scholar 

  22. Mirzasoleiman B, Babaei M, Jalili M, Safari M (2011) Cascaded failures in weighted networks. Phys Rev E Stat Nonlinear Soft Matter Phys 84(2):046114

    Google Scholar 

  23. Zhang CJ, Zeng A (2014) Network skeleton for synchronization: identifying redundant connections. Physica A 402(10):180–185

    MathSciNet  MATH  Google Scholar 

  24. Guimerà R, Díaz-Guilera A, Vega-Redondo F, Cabrales A, Arenas A (2002) Optimal network topologies for local search with congestion. Phys Rev Lett 9(24):248701

    Google Scholar 

  25. Yan G, Zhou T, Hu B, Fu ZQ, Wang BH (2006) Efficient routing on complex networks. Phys Rev E Stat Nonlinear Soft Matter Phys 73(2):046108

    Google Scholar 

  26. Zeng A, Zhang CJ (2013) Ranking spreaders by decomposing complex networks. Phys Lett A 377(14):1031–1035

    Google Scholar 

  27. Wang Z, Zhao Y, Xi J, Du C (2016) Fast ranking influential nodes in complex networks using a k-shell iteration factor. Physica A 461:171–181

    Google Scholar 

  28. Wang Z, Du C, Fan J, Xing Y (2017) Ranking influential nodes in social networks based on node position and neighborhood. Neurocomputing 260:466–477

    Google Scholar 

  29. Lin JH, Guo Q, Dong WZ, Tang LY, Liu JG (2014) Identifying the node spreading influence with largest k -core values. Phys Lett A 378(45):3279–3284

    MATH  Google Scholar 

  30. Franceschet M (2010) Pagerank: standing on the shoulders of giants. Commun ACM 54(6):92–101

    Google Scholar 

  31. Li Q, Zhou T, Lü L, Chen D (2014) Identifying influential spreaders by weighted leaderrank. Physica A 404(24):47–55

    MathSciNet  MATH  Google Scholar 

  32. Gao C, Wei D, Hu Y, Mahadevan S, Deng Y (2013) A modified evidential methodology of identifying influential nodes in weighted networks. Physica A S392(21):5490–5500

    MathSciNet  MATH  Google Scholar 

  33. Liu Y, Tang M, Zhou T, Do Y (2016) Identify influential spreaders in complex networks, the role of neighborhood. Physica A 452(3):289–298

    Google Scholar 

  34. Bian T, Deng Y (2017) A new evidential methodology of identifying influential nodes in complex networks. Chaos, Solitons Fractals 103(2):101–110

    MathSciNet  MATH  Google Scholar 

  35. Bao ZK, Ma C, Xiang BB, Zhang HF (2016) Identification of influential nodes in complex networks: method from spreading probability viewpoint. Physica A 468

    MATH  Google Scholar 

  36. Ma Q, Ma J (2017) Identifying and ranking influential spreaders in complex networks with consideration of spreading probability. Physica A 465:312–330

    Google Scholar 

  37. Watts DJ, Strogatz SH (2011) Collective dynamics of 'small-world' networks. Nature 1998:440–442

    MATH  Google Scholar 

  38. Castellano C, Pastorsatorras R (2010) Thresholds for epidemic spreading in networks. Phys Rev Lett 105(21):218701

    Google Scholar 

  39. Knight WR (1966) A computer method for calculating kendall's tau with ungrouped data. Publ Am Stat Assoc 61(314):436–439

    MATH  Google Scholar 

  40. Yang F, Zhang R, Yang Z, Hu R, Li M, Yuan Y et al (2017) Identifying the most influential spreaders in complex networks by an extended local k-shell sum.Int. J. Mod Phys C 28(01):925–214

    MathSciNet  Google Scholar 

  41. Zhu C, Wang X, Zhu L (2017) A novel method of evaluating key nodes in complex networks. Chaos, Solitons Fractals 96:43–50

    MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by China Postdoctoral Science Foundation (No. 2016 M592697) and Key Science and Technology Project of Shandong Province of China (No. 2014GGH201022).

Author information

Authors and Affiliations

  1. School of Data and Computer Science, Shandong Women’s University, Jinan, China

    Zengzhen Shao & Yanxiu Liu

  2. School of Information Science and Engineering, Shandong Normal University, Jinan, China

    Zengzhen Shao, Shulei Liu & Yanyu Zhao

Authors
  1. Zengzhen Shao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shulei Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yanyu Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yanxiu Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zengzhen Shao.

Additional information

This article is part of the Topical Collection: Special Issue on Fog/Edge Networking for Multimedia Applications

Guest Editors: Yong Jin, Hang Shen, Daniele D'Agostino, Nadjib Achir, and James Nightingale

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

The original version of this article was revised due to an Open Access cancellation after publication.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shao, Z., Liu, S., Zhao, Y. et al. Identifying influential nodes in complex networks based on Neighbours and edges. Peer-to-Peer Netw. Appl. 12, 1528–1537 (2019). https://doi.org/10.1007/s12083-018-0681-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-018-0681-x

Keywords

Search

Navigation