A mixed strength decomposition method for identifying critical nodes by decomposing weighted social networks

被引:0
|
作者
Yin, Hang [1 ,2 ]
Hou, Jishan [1 ]
Gong, Chengju [1 ]
机构
[1] Harbin Engn Univ Harbin, Sch Econ & Management, Harbin, Peoples R China
[2] Harbin Engn Univ Harbin, Ctr Big Data & Business Intelligence, Harbin, Peoples R China
关键词
COMPLEX NETWORKS; INFLUENTIAL SPREADERS; BEHAVIOR;
D O I
10.1209/0295-5075/acd9e8
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Identifying critical nodes is an efficient strategy for preventing the dynamics of risk dissemination. The properties of edges connecting to the removed nodes are assumed to be the same by many decomposition methods. However, the edge weights are always different in weighted social networks since they have certain practical implications. In this study, a mixed strength decomposition (MSD) method is proposed to identify critical nodes in weighted social networks. This method aims to address the issue of not accounting for the information on removed nodes by considering both residual strength and exhausted strength. Three experimental analyses -the monotonicity test, Susceptible-Infected (SI) diffusion simulation, and successive node re-moval experiments- conducted on six real-world networks demonstrate that the MSD method has a competitive performance in identifying critical nodes, which overcomes the instability of the node strength and the degeneracy of the s-core method.Copyright ⠂c 2023 EPLA
引用
下载
收藏
页数:8
相关论文
共 50 条
  • [21] THE LANDSCAPE OF COMPLEX NETWORKS - CRITICAL NODES AND A HIERARCHICAL DECOMPOSITION
    Weinan, E.
    Lu, Jianfeng
    Yao, Yuan
    METHODS AND APPLICATIONS OF ANALYSIS, 2013, 20 (04) : 383 - 404
  • [22] Identifying critical nodes in complex networks via graph convolutional networks
    Yu, En-Yu
    Wang, Yue-Ping
    Fu, Yan
    Chen, Duan-Bing
    Xie, Mei
    KNOWLEDGE-BASED SYSTEMS, 2020, 198
  • [23] Identifying influential nodes in social networks: A voting approach
    Liu, Panfeng
    Li, Longjie
    Fang, Shiyu
    Yao, Yukai
    CHAOS SOLITONS & FRACTALS, 2021, 152
  • [24] Identifying critical nodes in complex networks based on neighborhood information
    Zhao, Na
    Wang, Hao
    Wen, Jun-jie
    Li, Jie
    Jing, Ming
    Wang, Jian
    NEW JOURNAL OF PHYSICS, 2023, 25 (08):
  • [25] Efficient heuristic algorithm for identifying critical nodes in planar networks
    Purevsuren, Dalaijargal
    Cui, Gang
    COMPUTERS & OPERATIONS RESEARCH, 2019, 106 : 143 - 153
  • [26] Identifying critical nodes in interdependent networks by GA-XGBoost
    Zhong, Xingju
    Liu, Renjing
    RELIABILITY ENGINEERING & SYSTEM SAFETY, 2024, 251
  • [27] Identifying Critical Nodes in Protein-Protein Interaction Networks
    Boginski, Vladimir
    Commander, Clayton W.
    CLUSTER CHALLENGES IN BIOLOGICAL NETWORKS, 2009, : 153 - +
  • [28] CNLPSO-SL: A two-layered method for identifying influential nodes in social networks
    Pourkazemi, Maryam
    Keyvanpour, Mohammadreza
    INTERNATIONAL JOURNAL OF KNOWLEDGE-BASED AND INTELLIGENT ENGINEERING SYSTEMS, 2018, 22 (02) : 109 - 123
  • [29] Identifying Influential Nodes Using a Shell-Based Ranking and Filtering Method in Social Networks
    Beni, Hamid Ahmadi
    Bouyer, Asgarali
    BIG DATA, 2021, 9 (03) : 219 - 232
  • [30] A novel centrality measure for identifying influential nodes based on minimum weighted degree decomposition
    Lu, Pengli
    Zhang, Zhiru
    Guo, Yuhong
    Chen, Yahong
    INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2021, 35 (24):