Skip to main content
Erschienen in: Computing 1/2024

29.08.2023 | Regular Paper

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

verfasst von: Kushal Kanwar, Sakshi Kaushal, Harish Kumar, Gaurav Gupta, Manju Khari

Erschienen in: Computing | Ausgabe 1/2024

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Dorogovtsev SN, Goltsev AV, Mendes JFF (2008) Critical phenomena in complex networks. Rev Mod Phys 80(4):1275CrossRef Dorogovtsev SN, Goltsev AV, Mendes JFF (2008) Critical phenomena in complex networks. Rev Mod Phys 80(4):1275CrossRef
2.
Zurück zum Zitat Pastor-Satorras R, Castellano C, Van Mieghem P, Vespignani A (2015) Epidemic processes in complex networks. Rev Mod Phys 87(3):925MathSciNetCrossRef Pastor-Satorras R, Castellano C, Van Mieghem P, Vespignani A (2015) Epidemic processes in complex networks. Rev Mod Phys 87(3):925MathSciNetCrossRef
3.
Zurück zum Zitat Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web 1(1):5CrossRef Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web 1(1):5CrossRef
4.
Zurück zum Zitat 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–1031CrossRef 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–1031CrossRef
5.
Zurück zum Zitat Allcott H, Gentzkow M (2017) Social media and fake news in the 2016 election. J Econ Perspect 31(2):211–36CrossRef Allcott H, Gentzkow M (2017) Social media and fake news in the 2016 election. J Econ Perspect 31(2):211–36CrossRef
6.
Zurück zum Zitat Little RG (2002) Controlling cascading failure: understanding the vulnerabilities of interconnected infrastructures. J Urban Technol 9(1):109–123CrossRef Little RG (2002) Controlling cascading failure: understanding the vulnerabilities of interconnected infrastructures. J Urban Technol 9(1):109–123CrossRef
7.
Zurück zum Zitat Tripathy RM, Bagchi A, Mehta S (2013) Towards combating rumors in social networks: models and metrics. Intell Data Anal 17(1):149–175CrossRef Tripathy RM, Bagchi A, Mehta S (2013) Towards combating rumors in social networks: models and metrics. Intell Data Anal 17(1):149–175CrossRef
8.
Zurück zum Zitat Bandura A (2004) Health promotion by social cognitive means. Health Edu Behav 31(2):143–164CrossRef Bandura A (2004) Health promotion by social cognitive means. Health Edu Behav 31(2):143–164CrossRef
9.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat Pastor-Satorras R, Vespignani A (2001) Epidemic dynamics and endemic states in complex networks. Phys Rev E 63(6):066117CrossRef Pastor-Satorras R, Vespignani A (2001) Epidemic dynamics and endemic states in complex networks. Phys Rev E 63(6):066117CrossRef
12.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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–893CrossRef 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–893CrossRef
15.
Zurück zum Zitat Bae J, Kim S (2014) Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Physica A 395:549–559MathSciNetCrossRef Bae J, Kim S (2014) Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Physica A 395:549–559MathSciNetCrossRef
16.
Zurück zum Zitat 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–181CrossRef 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–181CrossRef
17.
Zurück zum Zitat Zareie A, Sheikhahmadi A (2018) A hierarchical approach for influential node ranking in complex social networks. Expert Syst Appl 93:200–211CrossRef Zareie A, Sheikhahmadi A (2018) A hierarchical approach for influential node ranking in complex social networks. Expert Syst Appl 93:200–211CrossRef
18.
Zurück zum Zitat Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Netw 1(3):215–239CrossRef Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Netw 1(3):215–239CrossRef
19.
Zurück zum Zitat Freeman Linton C (1977) A set of measures of centrality based on betweenness. Sociometry, pp 35–41 Freeman Linton C (1977) A set of measures of centrality based on betweenness. Sociometry, pp 35–41
21.
23.
Zurück zum Zitat Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163–177CrossRef Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163–177CrossRef
24.
Zurück zum Zitat Chen D, Lü L, Shang M-S, Zhang Y-C, Zhou T (2012) Identifying influential nodes in complex networks. Physica A 391(4):1777–1787CrossRef Chen D, Lü L, Shang M-S, Zhang Y-C, Zhou T (2012) Identifying influential nodes in complex networks. Physica A 391(4):1777–1787CrossRef
25.
Zurück zum Zitat 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–63MathSciNetCrossRef 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–63MathSciNetCrossRef
26.
Zurück zum Zitat Zareie A, Sheikhahmadi A (2019) Ehc: Extended h-index centrality measure for identification of users’ spreading influence in complex networks. Physica A 514:141–155CrossRef Zareie A, Sheikhahmadi A (2019) Ehc: Extended h-index centrality measure for identification of users’ spreading influence in complex networks. Physica A 514:141–155CrossRef
27.
Zurück zum Zitat 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:10168CrossRef 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:10168CrossRef
28.
Zurück zum Zitat 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–7MathSciNetCrossRef 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–7MathSciNetCrossRef
29.
Zurück zum Zitat 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):1850118CrossRef 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):1850118CrossRef
30.
Zurück zum Zitat Borgatti SP, Everett MG (2000) Models of core/periphery structures. Soc Netw 21(4):375–395CrossRef Borgatti SP, Everett MG (2000) Models of core/periphery structures. Soc Netw 21(4):375–395CrossRef
31.
Zurück zum Zitat Zeng A, Zhang C-J (2013) Ranking spreaders by decomposing complex networks. Phys Lett A 377(14):1031–1035CrossRef Zeng A, Zhang C-J (2013) Ranking spreaders by decomposing complex networks. Phys Lett A 377(14):1031–1035CrossRef
32.
Zurück zum Zitat 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–523MathSciNetCrossRef 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–523MathSciNetCrossRef
33.
Zurück zum Zitat 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 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.
Zurück zum Zitat Namtirtha A, Dutta A, Dutta B (2018) Identifying influential spreaders in complex networks based on Kshell hybrid method. Physica A 499:310–324CrossRef Namtirtha A, Dutta A, Dutta B (2018) Identifying influential spreaders in complex networks based on Kshell hybrid method. Physica A 499:310–324CrossRef
35.
Zurück zum Zitat Wang J, Li C, Xia C (2018) Improved centrality indicators to characterize the nodal spreading capability in complex networks. Appl Math Comput 334:388–400MathSciNet Wang J, Li C, Xia C (2018) Improved centrality indicators to characterize the nodal spreading capability in complex networks. Appl Math Comput 334:388–400MathSciNet
36.
Zurück zum Zitat Namtirtha A, Dutta A, Dutta B (2018) Identifying influential spreaders in complex networks based on Kshell hybrid method. Physica A 499:310–324CrossRef Namtirtha A, Dutta A, Dutta B (2018) Identifying influential spreaders in complex networks based on Kshell hybrid method. Physica A 499:310–324CrossRef
37.
Zurück zum Zitat Liu P, Li L, Fang S, Yao Y (2021) Identifying influential nodes in social networks: a voting approach. Chaos, Solitons Fractals 152:111309CrossRef Liu P, Li L, Fang S, Yao Y (2021) Identifying influential nodes in social networks: a voting approach. Chaos, Solitons Fractals 152:111309CrossRef
38.
Zurück zum Zitat Zareie A, Sheikhahmadi A, Khamforoosh K (2018) Influence maximization in social networks based on topsis. Expert Syst Appl 108:96–107CrossRef Zareie A, Sheikhahmadi A, Khamforoosh K (2018) Influence maximization in social networks based on topsis. Expert Syst Appl 108:96–107CrossRef
39.
Zurück zum Zitat 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:127797MathSciNetCrossRef 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:127797MathSciNetCrossRef
40.
Zurück zum Zitat 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):1944CrossRef 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):1944CrossRef
41.
Zurück zum Zitat Hashemi A, Dowlatshahi MB, Nezamabadi-pour H (2020) Mgfs: a multi-label graph-based feature selection algorithm via PageRank centrality. Expert Syst Appl 142:113024CrossRef Hashemi A, Dowlatshahi MB, Nezamabadi-pour H (2020) Mgfs: a multi-label graph-based feature selection algorithm via PageRank centrality. Expert Syst Appl 142:113024CrossRef
42.
Zurück zum Zitat 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–1720CrossRef 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–1720CrossRef
43.
Zurück zum Zitat Zareie A, Sheikhahmadi A, Jalili M (2020) Identification of influential users in social network using gray wolf optimization algorithm. Expert Syst Appl 142:112971CrossRef Zareie A, Sheikhahmadi A, Jalili M (2020) Identification of influential users in social network using gray wolf optimization algorithm. Expert Syst Appl 142:112971CrossRef
44.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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):52MathSciNetCrossRef 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):52MathSciNetCrossRef
46.
Zurück zum Zitat Maurya SK, Liu X, Murata T (2021) Graph neural networks for fast node ranking approximation. ACM Trans Knowl Discov Data 15(5):1–32CrossRef Maurya SK, Liu X, Murata T (2021) Graph neural networks for fast node ranking approximation. ACM Trans Knowl Discov Data 15(5):1–32CrossRef
47.
Zurück zum Zitat 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:109220CrossRef 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:109220CrossRef
48.
Zurück zum Zitat 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 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.
Zurück zum Zitat Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110CrossRef Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110CrossRef
51.
Zurück zum Zitat Erdös P, Rényi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5(17–61):43MathSciNet Erdös P, Rényi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5(17–61):43MathSciNet
53.
Zurück zum Zitat Kunegis J (2013) Konect: the Koblenz network collection. In: Proceedings of the 22nd international conference on World Wide Web, pp. 1343–1350. ACM Kunegis J (2013) Konect: the Koblenz network collection. In: Proceedings of the 22nd international conference on World Wide Web, pp. 1343–1350. ACM
54.
Zurück zum Zitat Liu Y, Tang M, Zhou T, Do Y (2016) Identify influential spreaders in complex networks, the role of neighborhood. Physica A 452:289–298CrossRef Liu Y, Tang M, Zhou T, Do Y (2016) Identify influential spreaders in complex networks, the role of neighborhood. Physica A 452:289–298CrossRef
55.
Zurück zum Zitat 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):76CrossRef 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):76CrossRef
57.
Zurück zum Zitat Knight WR (1966) A computer method for calculating Kendall’s tau with ungrouped data. J Am Stat Assoc 61(314):436–439CrossRef Knight WR (1966) A computer method for calculating Kendall’s tau with ungrouped data. J Am Stat Assoc 61(314):436–439CrossRef
58.
Zurück zum Zitat Kushal K, Sakshi K, Harish K (2019) A hybrid node ranking technique for finding influential nodes in complex social networks. Library Hi Tech Kushal K, Sakshi K, Harish K (2019) A hybrid node ranking technique for finding influential nodes in complex social networks. Library Hi Tech
59.
Zurück zum Zitat Webber W, Moffat A, Zobel J (2010) A similarity measure for indefinite rankings. ACM Trans Inf Syst 28(4):20CrossRef Webber W, Moffat A, Zobel J (2010) A similarity measure for indefinite rankings. ACM Trans Inf Syst 28(4):20CrossRef
61.
Zurück zum Zitat Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT Press, Cambridge Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT Press, Cambridge
Metadaten
Titel
An efficient method for node ranking in complex networks by hybrid neighbourhood coreness
verfasst von
Kushal Kanwar
Sakshi Kaushal
Harish Kumar
Gaurav Gupta
Manju Khari
Publikationsdatum
29.08.2023
Verlag
Springer Vienna
Erschienen in
Computing / Ausgabe 1/2024
Print ISSN: 0010-485X
Elektronische ISSN: 1436-5057
DOI
https://doi.org/10.1007/s00607-023-01218-1

Weitere Artikel der Ausgabe 1/2024

Computing 1/2024 Zur Ausgabe

Premium Partner