Isolating Coefficient-Based Framework to Recognize Influential Nodes in Complex Networks

Buran Basha Mohammad

doi:10.1109/ACCESS.2024.3507384

2024-01-01

Buran Basha Mohammad

Sateeshkrishna Dhuli

Murali Krishna Enduri

Linga Reddy Cenkeramaddi *

DOI：10.1109/ACCESS.2024.3507384

原文链接

原文求助

摘要

En 中文

Identifying influential nodes within complex networks holds significant importance for enhancing network resilience and understanding vulnerabilities, thereby providing insights for both theoretical exploration and practical applications. Understanding how quickly information spreads highlights the need to identify influential nodes promptly. Certain global centrality measures, including betweenness (BC), closeness (CC), eigenvector (EC), katz centrality, and coreness score (CR), fail to recognize influential nodes situated near the periphery of the network and those with direct connections to the target node. In response to these challenges and to enhance the influence of identification, we have developed a comprehensive framework, namely ISC , grounded in isolating coefficient, encompassing both a node's direct connections and those of its neighbors. Using the proposed approach, we defined six new centrality measures, including isolating katz centrality (ISKC), isolating coreness centrality (ISCR), isolating eigenvector centrality (ISEC), isolating betweenness centrality (ISBC), isolating closeness centrality (ISCC), and isolating clustering coefficient centrality (ISCL). Through comparative analysis across five real-world networks, ISC is evaluated alongside existing centrality measures, confirming its effectiveness in identifying influential nodes while maintaining reasonable computational efficiency. The experimental results affirm that ISC outperforms other centrality measures in locating influential nodes within complex networks. Additionally, we evaluate the similarity between our proposed methods and both conventional and recent measures by assessing rank correlations using Kendall's tau coefficient. The simulation outcomes indicate that one of the proposed methods ISCR, utilizing a lower-complexity algorithm, effectively identifies the most influential nodes with high accuracy. Furthermore, statistical techniques were employed to evaluate the proposed methods, demonstrating high reliability and precision in predicting influential nodes across various datasets, as indicated by low standard deviations and narrow confidence intervals.

Keyword:

Measurement

Complex networks

Time complexity

Social networking (online)

Resilience

Accuracy

Time measurement

Length measurement

Current measurement

Volume measurement

influential nodes