Identification of nodes influence based on global structure model in complex networks

Identification of Influential nodes in complex networks is challenging due to the largely scaled data and network sizes, and frequently changing behaviors of the current topologies. Various application scenarios like disease transmission and immunization, software virus infection and disinfection, i...

Full description

Saved in:
Bibliographic Details
Published in:Scientific reports 2021-03, Vol.11 (1), p.6173-6173, Article 6173
Main Authors: Ullah, Aman, Wang, Bin, Sheng, JinFang, Long, Jun, Khan, Nasrullah, Sun, ZeJun
Format: Article
Language:English
Subjects:
639/705/117
639/705/258
Algorithms
Benchmarks
Disease transmission
Disinfection
Humanities and Social Sciences
Immunization
multidisciplinary
Nodes
Science
Science (multidisciplinary)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Identification of Influential nodes in complex networks is challenging due to the largely scaled data and network sizes, and frequently changing behaviors of the current topologies. Various application scenarios like disease transmission and immunization, software virus infection and disinfection, increased product exposure and rumor suppression, etc., are applicable domains in the corresponding networks where identification of influential nodes is crucial. Though a lot of approaches are proposed to address the challenges, most of the relevant research concentrates only on single and limited aspects of the problem. Therefore, we propose Global Structure Model (GSM) for influential nodes identification that considers self-influence as well as emphasizes on global influence of the node in the network. We applied GSM and utilized Susceptible Infected Recovered model to evaluate its efficiency. Moreover, various standard algorithms such as Betweenness Centrality, Profit Leader, H-Index, Closeness Centrality, Hyperlink Induced Topic Search, Improved K-shell Hybrid, Density Centrality, Extended Cluster Coefficient Ranking Measure, and Gravity Index Centrality are employed as baseline benchmarks to evaluate the performance of GSM. Similarly, we used seven real-world and two synthetic multi-typed complex networks along-with different well-known datasets for experiments. Results analysis indicates that GSM outperformed the baseline algorithms in identification of influential node(s).
ISSN:2045-2322
2045-2322
DOI:10.1038/s41598-021-84684-x