Dynamic identification of important nodes in complex networks by considering local and global characteristics

被引:5
作者
Cao, Mengchuan [1 ]
Wu, Dan [1 ]
Du, Pengxuan [1 ]
Zhang, Ting [1 ]
Ahmadi, Sina [2 ]
机构
[1] Ningxia Polytech, Sch Software, Yinchuan 750021, Ningxia, Peoples R China
[2] Islamic Azad Univ, Dept Comp Engn, West Tehran Branch, Tehran, Iran
关键词
complex networks; important nodes; local and global characteristics; network constraint coefficient; CENTRALITY; SPREADERS; RANKING;
D O I
10.1093/comnet/cnae015
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
By combining centrality measures and community detection, a better insight into the nature of the evolution of important nodes in complex networks is obtained. Meanwhile, the dynamic identification of important nodes in complex networks can be enhanced by considering both local and global characteristics. Local characteristics focus on the immediate connections and interactions of a node within its neighbourhood, while global characteristics take into account the overall structure and dynamics of the entire network. Nodes with high local centrality in dynamic networks may play crucial roles in local information spreading or influence. On the global level, community detection algorithms have a significant impact on the overall network structure and connectivity between important nodes. Hence, integrating both local and global characteristics offers a more comprehensive understanding of how nodes dynamically contribute to the functioning of complex networks. For more comprehensive analysis of complex networks, this article identifies important nodes by considering local and global characteristics (INLGC). For local characteristic, INLGC develops a centrality measure based on network constraint coefficient, which can provide a better understanding of the relationship between neighbouring nodes. For global characteristic, INLGC develops a community detection method to improve the resolution of ranking important nodes. Extensive experiments have been conducted on several real-world datasets and various performance metrics have been evaluated based on the susceptible-infected-recovered model. The simulation results show that INLGC provides more competitive advantages in precision and resolution.
引用
收藏
页数:16
相关论文
共 57 条
  • [21] A new improved fractional Tikhonov regularization method for moving force identification
    Li, Mingqiang
    Wang, Linjun
    Luo, Chengsheng
    Wu, Hongchun
    [J]. STRUCTURES, 2024, 60
  • [22] Hybrid Method with Parallel-Factor Theory, a Support Vector Machine, and Particle Filter Optimization for Intelligent Machinery Failure Identification
    Li, Shaoyi
    Chen, Hanxin
    Chen, Yongting
    Xiong, Yunwei
    Song, Ziwei
    [J]. MACHINES, 2023, 11 (08)
  • [23] Application of RBF neural network optimal segmentation algorithm in credit rating
    Li, Xuetao
    Sun, Yi
    [J]. NEURAL COMPUTING & APPLICATIONS, 2021, 33 (14) : 8227 - 8235
  • [24] Li ZL, 2019, SCI REP-UK, V9, DOI [10.1038/s41598-019-39816-9, 10.1038/s41598-019-44930-9]
  • [25] An Integrated Multi-Task Model for Fake News Detection
    Liao, Qing
    Chai, Heyan
    Han, Hao
    Zhang, Xiang
    Wang, Xuan
    Xia, Wen
    Ding, Ye
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (11) : 5154 - 5165
  • [26] On the Analytical Probabilistic Modeling of Flow Transmission Across Nodes in Transportation Networks
    Lu, Jing
    Osorio, Carolina
    [J]. TRANSPORTATION RESEARCH RECORD, 2022, 2676 (12) : 209 - 225
  • [27] A Novel Airspace Planning Algorithm for Cooperative Target Localization
    Mao, Yi
    Zhu, Yongwen
    Tang, Zhili
    Chen, Zhijie
    [J]. ELECTRONICS, 2022, 11 (18)
  • [28] Modeling Hereditary Disease Behavior Using an Innovative Similarity Criterion and Ensemble Clustering
    Mojarad, Musa
    Sarhangnia, Fariba
    Rezaeipanah, Amin
    Parvin, Hamin
    Nejatian, Samad
    [J]. CURRENT BIOINFORMATICS, 2021, 16 (05) : 749 - 764
  • [29] A measure of betweenness centrality based on random walks
    Newman, MEJ
    [J]. SOCIAL NETWORKS, 2005, 27 (01) : 39 - 54
  • [30] Pattanayak H. S., 2024, J. Complex Netw, V12, pcna