Skip to main content
SpringerLink
Log in

An efficient method for node ranking in complex networks by hybrid neighbourhood coreness

  • Regular Paper
  • Published:
Computing Aims and scope Submit manuscript

Abstract

Contagion spread is a common phenomenon observable on a variety of complex networks. The knowledge of key spreaders and contagion dynamics facilitates the design of applications that can either reduce the spread of unwanted contagion or amplify the proliferation of desired ones. Hence, it is essential to identify and rank the influential (key) spreaders in complex networks. Extended neighbourhood coreness (Cnc+) is one such method that uses the k-shell index to identify and rank the influential spreaders. The neighborhood of a node plays a very important role in contagion spread and the combination of local and global topological information of a node can better capture the spreading influence of the nodes. In this paper, a measure, namely, hybrid Cnc+ coreNess (HCN) is proposed that extends Cnc+ by including first and second order neighbourhood of a node (local information) along with the k-shell index. In experiments, HCN is compared with state of the art methods for both real and artificial datasets. The results show that HCN is accurate and better than state of the art methods. Further, least variation in ranking accuracy is observed in experiments of parameter variation for artificial networks. Computational complexity analysis shows that the proposed method achieves high accuracy incurring a small computational penalty.

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
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Availability of data and material

Datasets and software library (networkx) is publicly available.

Code availability

Code is available on request.

References

  1. Dorogovtsev SN, Goltsev AV, Mendes JFF (2008) Critical phenomena in complex networks. Rev Mod Phys 80(4):1275

    Article  Google Scholar 

  2. Pastor-Satorras R, Castellano C, Van Mieghem P, Vespignani A (2015) Epidemic processes in complex networks. Rev Mod Phys 87(3):925

    Article  MathSciNet  Google Scholar 

  3. Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web 1(1):5

    Article  Google Scholar 

  4. Christley RM, Pinchbeck GL, Bowers RG, Clancy D, French NP, Bennett R, Turner J (2005) Infection in social networks: using network analysis to identify high-risk individuals. Am J Epidemiol 162(10):1024–1031

    Article  Google Scholar 

  5. Allcott H, Gentzkow M (2017) Social media and fake news in the 2016 election. J Econ Perspect 31(2):211–36

    Article  Google Scholar 

  6. Little RG (2002) Controlling cascading failure: understanding the vulnerabilities of interconnected infrastructures. J Urban Technol 9(1):109–123

    Article  Google Scholar 

  7. Tripathy RM, Bagchi A, Mehta S (2013) Towards combating rumors in social networks: models and metrics. Intell Data Anal 17(1):149–175

    Article  Google Scholar 

  8. Bandura A (2004) Health promotion by social cognitive means. Health Edu Behav 31(2):143–164

    Article  Google Scholar 

  9. Lenhart A, Purcell K, Smith A, Zickuhr K (2010) Social media & mobile internet use among teens and young adults. millennials. Pew internet & American life project

  10. Hadgu Asmelash T, Garimella K, Weber I (2013) Political hashtag hijacking in the us. In: Proceedings of the 22nd international conference on World Wide Web, pp. 55–56. ACM

  11. Pastor-Satorras R, Vespignani A (2001) Epidemic dynamics and endemic states in complex networks. Phys Rev E 63(6):066117

    Article  Google Scholar 

  12. Carnes T, Nagarajan C, Wild Stefan M, Van Zuylen A (2007) Maximizing influence in a competitive social network: a follower’s perspective. In: Proceedings of the ninth international conference on Electronic commerce, pp. 351–360. ACM

  13. Borodin A, Filmus Y, Oren J (2010) Threshold models for competitive influence in social networks. In: International workshop on internet and network economics, pp. 539–550. Springer

  14. Kitsak M, Gallos LK, Havlin S, Liljeros F, Lev Muchnik H, Stanley E, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888–893

    Article  Google Scholar 

  15. Bae J, Kim S (2014) Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Physica A 395:549–559

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  17. Zareie A, Sheikhahmadi A (2018) A hierarchical approach for influential node ranking in complex social networks. Expert Syst Appl 93:200–211

    Article  Google Scholar 

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

    Article  Google Scholar 

  19. Freeman Linton C (1977) A set of measures of centrality based on betweenness. Sociometry, pp 35–41

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

    Article  MathSciNet  Google Scholar 

  21. Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345

    Article  Google Scholar 

  22. Johnson DB (1977) Efficient algorithms for shortest paths in sparse networks. J ACM 24(1):1–13

    Article  MathSciNet  Google Scholar 

  23. Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163–177

    Article  Google Scholar 

  24. Chen D, Lü L, Shang M-S, Zhang Y-C, Zhou T (2012) Identifying influential nodes in complex networks. Physica A 391(4):1777–1787

    Article  Google Scholar 

  25. Lü L, Chen D, Ren X-L, Zhang Q-M, Zhang Y-C, Zhou T (2016) Vital nodes identification in complex networks. Phys Rep 650:1–63

    Article  MathSciNet  Google Scholar 

  26. Zareie A, Sheikhahmadi A (2019) Ehc: Extended h-index centrality measure for identification of users’ spreading influence in complex networks. Physica A 514:141–155

    Article  Google Scholar 

  27. Lü L, Zhou T, Zhang Q-M, Eugene Stanley H (2016) The H-index of a network node and its relation to degree and coreness. Nat Commun 7:10168

    Article  Google Scholar 

  28. Liu Y, Wei B, Yuxian D, Xiao F, Deng Y (2016) Identifying influential spreaders by weight degree centrality in complex networks. Chaos Solitons Fractals 86:1–7

    Article  MathSciNet  Google Scholar 

  29. Li M, Zhang R, Rongjing H, 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(06):1850118

    Article  Google Scholar 

  30. Borgatti SP, Everett MG (2000) Models of core/periphery structures. Soc Netw 21(4):375–395

    Article  Google Scholar 

  31. Zeng A, Zhang C-J (2013) Ranking spreaders by decomposing complex networks. Phys Lett A 377(14):1031–1035

    Article  Google Scholar 

  32. Li C, Wang L, Sun S, Xia C (2018) Identification of influential spreaders based on classified neighbors in real-world complex networks. Appl Math Comput 320:512–523

    Article  MathSciNet  Google Scholar 

  33. Salavati C, Abdollahpouri A, Manbari Z (2017) Bridgerank: A novel fast centrality measure based on local structure of the network. Physica A Stat Mech Appl

  34. Namtirtha A, Dutta A, Dutta B (2018) Identifying influential spreaders in complex networks based on Kshell hybrid method. Physica A 499:310–324

    Article  Google Scholar 

  35. Wang J, Li C, Xia C (2018) Improved centrality indicators to characterize the nodal spreading capability in complex networks. Appl Math Comput 334:388–400

    MathSciNet  Google Scholar 

  36. Namtirtha A, Dutta A, Dutta B (2018) Identifying influential spreaders in complex networks based on Kshell hybrid method. Physica A 499:310–324

    Article  Google Scholar 

  37. Liu P, Li L, Fang S, Yao Y (2021) Identifying influential nodes in social networks: a voting approach. Chaos, Solitons Fractals 152:111309

    Article  Google Scholar 

  38. Zareie A, Sheikhahmadi A, Khamforoosh K (2018) Influence maximization in social networks based on topsis. Expert Syst Appl 108:96–107

    Article  Google Scholar 

  39. Dong C, Guiqiong X, Meng L, Yang P (2022) Cpr-topsis: A novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy. Physica A 603:127797

    Article  MathSciNet  Google Scholar 

  40. Zhang Y, Yuliang L, Yang G, Hang Z (2022) Multi-attribute decision making method for node importance metric in complex network. Appl Sci 12(4):1944

    Article  Google Scholar 

  41. Hashemi A, Dowlatshahi MB, Nezamabadi-pour H (2020) Mgfs: a multi-label graph-based feature selection algorithm via PageRank centrality. Expert Syst Appl 142:113024

    Article  Google Scholar 

  42. Zhao J, Wen T, Jahanshahi H, Cheong KH (2022) The random walk-based gravity model to identify influential nodes in complex networks. Inf Sci 609:1706–1720

    Article  Google Scholar 

  43. Zareie A, Sheikhahmadi A, Jalili M (2020) Identification of influential users in social network using gray wolf optimization algorithm. Expert Syst Appl 142:112971

    Article  Google Scholar 

  44. Devi S, Rajalakshmi M (2023) Community based influencer node identification using hybrid optimisation algorithm in social networks. J Exp Theor Artif Intell, pp 1–28

  45. Li Y, Cai W, Li Y, Xin D (2020) Key node ranking in complex networks: a novel entropy and mutual information-based approach. Entropy 22(1):52

    Article  MathSciNet  Google Scholar 

  46. Maurya SK, Liu X, Murata T (2021) Graph neural networks for fast node ranking approximation. ACM Trans Knowl Discov Data 15(5):1–32

    Article  Google Scholar 

  47. Liu C, Cao T, Zhou L (2022) Learning to rank complex network node based on the self-supervised graph convolution model. Knowl-Based Syst 251:109220

    Article  Google Scholar 

  48. Hagberg Aric A, Schult Daniel A, Swart Pieter J (2008) Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in science conference (SciPy2008), pp. 11–15, Pasadena, CA USA

  49. Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110

    Article  Google Scholar 

  50. Erdös P, Rényi A (1959) On random graphs, i. Publicationes Mathematicae (Debrecen) 6:290–297

    Article  MathSciNet  Google Scholar 

  51. Erdös P, Rényi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5(17–61):43

    MathSciNet  Google Scholar 

  52. Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data

  53. Kunegis J (2013) Konect: the Koblenz network collection. In: Proceedings of the 22nd international conference on World Wide Web, pp. 1343–1350. ACM

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

    Article  Google Scholar 

  55. Hladish T, Melamud E, Barrera LA, Galvani A, Meyers LA (2012) Epifire: an open source c++ library and application for contact network epidemiology. BMC Bioinf 13(1):76

    Article  Google Scholar 

  56. Kendall MG (1945) The treatment of ties in ranking problems. Biometrika 33(3):239–251

    Article  MathSciNet  Google Scholar 

  57. Knight WR (1966) A computer method for calculating Kendall’s tau with ungrouped data. J Am Stat Assoc 61(314):436–439

    Article  Google Scholar 

  58. Kushal K, Sakshi K, Harish K (2019) A hybrid node ranking technique for finding influential nodes in complex social networks. Library Hi Tech

  59. Webber W, Moffat A, Zobel J (2010) A similarity measure for indefinite rankings. ACM Trans Inf Syst 28(4):20

    Article  Google Scholar 

  60. Schmidt FK (1931) Analytische zahlentheorie in körpern der charakteristikp. Math Z 33(1):1–32

    Article  MathSciNet  Google Scholar 

  61. Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT Press, Cambridge

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Jaypee University of Information Technology, Solan, 173215, India

    Kushal Kanwar

  2. UIET, Panjab University, Chandigarh, 160014, India

    Sakshi Kaushal & Harish Kumar

  3. Yogananda School of Artificial Inteligence Computers and Data Science, Shoolini University, Solan, 173229, India

    Gaurav Gupta

  4. School of Computing, Jawaharlal Nehru Universirty, New Delhi, India

    Manju Khari

Authors
  1. Kushal Kanwar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sakshi Kaushal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Harish Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gaurav Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Manju Khari
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Equal Contribution

Corresponding author

Correspondence to Kushal Kanwar.

Ethics declarations

Conflicts of interest

No Conflict of interest.

Ethics approval

Not applicable

Consent to participate

Not applicable

Consent for publication

The publication has been approved by all co-authors.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kanwar, K., Kaushal, S., Kumar, H. et al. An efficient method for node ranking in complex networks by hybrid neighbourhood coreness. Computing 106, 139–161 (2024). https://doi.org/10.1007/s00607-023-01218-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-023-01218-1

Keywords

Mathematics Subject Classification

Search

Navigation