中国物理B ›› 2023, Vol. 32 ›› Issue (11): 118901-118901.doi: 10.1088/1674-1056/ace682

• • 上一篇    下一篇

Assessing edge-coupled interdependent network disintegration via rank aggregation and elite enumeration

Yong-Hui Li(李咏徽), San-Yang Liu(刘三阳), and Yi-Guang Bai(白艺光)   

  1. School of Mathematics and Statistics, Xidian University, Xi'an 710071 China
  • 收稿日期:2023-04-04 修回日期:2023-07-03 接受日期:2023-07-12 出版日期:2023-10-16 发布日期:2023-10-16
  • 通讯作者: Yi-Guang Bai E-mail:ygbai@foxmail.com
  • 基金资助:
    This work was supported by the National Natural Science Foundation of China (Grant Nos. 61877046, 12271419, and 62106186), the Natural Science Basic Research Program of Shaanxi (Program No. 2022JQ-620), and the Fundamental Research Funds for the Central Universities (Grant Nos. XJS220709, JB210701, and QTZX23002).

Assessing edge-coupled interdependent network disintegration via rank aggregation and elite enumeration

Yong-Hui Li(李咏徽), San-Yang Liu(刘三阳), and Yi-Guang Bai(白艺光)   

  1. School of Mathematics and Statistics, Xidian University, Xi'an 710071 China
  • Received:2023-04-04 Revised:2023-07-03 Accepted:2023-07-12 Online:2023-10-16 Published:2023-10-16
  • Contact: Yi-Guang Bai E-mail:ygbai@foxmail.com
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (Grant Nos. 61877046, 12271419, and 62106186), the Natural Science Basic Research Program of Shaanxi (Program No. 2022JQ-620), and the Fundamental Research Funds for the Central Universities (Grant Nos. XJS220709, JB210701, and QTZX23002).

摘要: The disintegration of networks is a widely researched topic with significant applications in fields such as counter-terrorism and infectious disease control. While the traditional approaches for achieving network disintegration involve identifying critical sets of nodes or edges, limited research has been carried out on edge-based disintegration strategies. We propose a novel algorithm, i.e., a rank aggregation elite enumeration algorithm based on edge-coupled networks (RAEEC), which aims to implement tiling for edge-coupled networks by finding important sets of edges in the network while balancing effectiveness and efficiency. Our algorithm is based on a two-layer edge-coupled network model with one-to-one links, and utilizes three advanced edge importance metrics to rank the edges separately. A comprehensive ranking of edges is obtained using a rank aggregation approach proposed in this study. The top few edges from the ranking set obtained by RAEEC are then used to generate an enumeration set, which is continuously iteratively updated to identify the set of elite attack edges. We conduct extensive experiments on synthetic networks to evaluate the performance of our proposed method, and the results indicate that RAEEC achieves a satisfactory balance between efficiency and effectiveness. Our approach represents a significant contribution to the field of network disintegration, particularly for edge-based strategies.

关键词: edged-coupled, rank aggregation, interdependent networks, elite enumeration

Abstract: The disintegration of networks is a widely researched topic with significant applications in fields such as counter-terrorism and infectious disease control. While the traditional approaches for achieving network disintegration involve identifying critical sets of nodes or edges, limited research has been carried out on edge-based disintegration strategies. We propose a novel algorithm, i.e., a rank aggregation elite enumeration algorithm based on edge-coupled networks (RAEEC), which aims to implement tiling for edge-coupled networks by finding important sets of edges in the network while balancing effectiveness and efficiency. Our algorithm is based on a two-layer edge-coupled network model with one-to-one links, and utilizes three advanced edge importance metrics to rank the edges separately. A comprehensive ranking of edges is obtained using a rank aggregation approach proposed in this study. The top few edges from the ranking set obtained by RAEEC are then used to generate an enumeration set, which is continuously iteratively updated to identify the set of elite attack edges. We conduct extensive experiments on synthetic networks to evaluate the performance of our proposed method, and the results indicate that RAEEC achieves a satisfactory balance between efficiency and effectiveness. Our approach represents a significant contribution to the field of network disintegration, particularly for edge-based strategies.

Key words: edged-coupled, rank aggregation, interdependent networks, elite enumeration

中图分类号:  (Structures and organization in complex systems)

  • 89.75.Fb