A Novel Convex Combination-Based Mixed Centrality Measure for Identification of Influential Nodes in Complex Networks

被引:1
作者
Mohammad, Buran Basha [1 ]
Dhuli, V. Sateeshkrishna [1 ]
Enduri, Murali Krishna [2 ]
Cenkeramaddi, Linga Reddy [3 ]
机构
[1] SRM Univ AP, Dept Elect & Commun Engn, Amaravati 522502, India
[2] SRM Univ AP, Dept Comp Sci & Engn, Algorithms & Complex Theory Lab, Amaravati 522502, India
[3] Univ Agder UiA, Dept Informat & Commun Technol, N-4879 Grimstad, Norway
关键词
Complex networks; Measurement; Topology; Time measurement; Resilience; Object recognition; Computational complexity; local and global centrality; isolating centrality; connected components; critical nodes; SOCIAL NETWORKS; SPREADERS; RANKING; LEADERS;
D O I
10.1109/ACCESS.2024.3450296
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Exploring the significance of popular node's impact in complex networks yields numerous advantages, such as improving network resilience and accelerating information dissemination. While conventional centrality measures accurately quantify individual node importance, they may inadvertently overlook certain properties of influential nodes. The quest for new centrality metrics has garnered substantial research due to their theoretical relevance and practical applicability in real-world network scenarios. The existing research has predominantly focused on designing centrality metrics based on the local and/or global topological characteristics of nodes. Nevertheless, these metrics do not consider the nodes located in the intermediary zones between the inner and outer regions of a network, resulting in reduced effectiveness when applied to large-scale network scenarios. To address these challenges, we have introduced a novel convex framework to formulate the Convex Mixed Centrality (COMC) measure. This metric aims to overcome the limitations of traditional centrality metrics by incorporating insights from both local and global network dynamics, thus enhancing its ability to identify influential nodes across various network regions. To prove the efficacy of our proposed measure, we utilize the Susceptible-Infected-Recovered (SIR) and Independent Cascade (IC) models, alongside the Kendall tau metric. Extensive simulation experiments conducted on various real-world datasets demonstrate that the COMC measure outperforms conventional centrality indices in terms of spreading efficiency, all while maintaining comparable computational complexity.
引用
收藏
页码:123897 / 123920
页数:24
相关论文
共 66 条
[1]   Identification of influential spreaders in complex networks using HybridRank algorithm [J].
Ahajjam, Sara ;
Badir, Hassan .
SCIENTIFIC REPORTS, 2018, 8
[2]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[3]   A note on the complexity of Dijkstra's algorithm for graphs with weighted vertices [J].
Barbehenn, M .
IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (02) :263-263
[4]   SDAC-DA: Semi-Supervised Deep Attributed Clustering Using Dual Autoencoder [J].
Berahmand, Kamal ;
Bahadori, Sondos ;
Abadeh, Maryam Nooraei ;
Li, Yuefeng ;
Xu, Yue .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (11) :6989-7002
[5]   FACTORING AND WEIGHTING APPROACHES TO STATUS SCORES AND CLIQUE IDENTIFICATION [J].
BONACICH, P .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 1972, 2 (01) :113-120
[6]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117
[7]   Thresholds for Epidemic Spreading in Networks [J].
Castellano, Claudio ;
Pastor-Satorras, Romualdo .
PHYSICAL REVIEW LETTERS, 2010, 105 (21)
[8]   Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering [J].
Chen, Duan-Bing ;
Gao, Hui ;
Lu, Linyuan ;
Zhou, Tao .
PLOS ONE, 2013, 8 (10)
[9]   Identifying influential nodes in complex networks [J].
Chen, Duanbing ;
Lu, Linyuan ;
Shang, Ming-Sheng ;
Zhang, Yi-Cheng ;
Zhou, Tao .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) :1777-1787
[10]   On community structure in complex networks: challenges and opportunities [J].
Cherifi, Hocine ;
Palla, Gergely ;
Szymanski, Boleslaw K. ;
Lu, Xiaoyan .
APPLIED NETWORK SCIENCE, 2019, 4 (01)