A study on centrality measures in weighted networks: A case of the aviation network

被引:1
|
作者
Zhao, Shuying [1 ]
Sun, Shaowei [1 ]
机构
[1] Zhejiang Univ Sci & Technol, Sch Sci, Hangzhou 310023, Zhejiang, Peoples R China
来源
AIMS MATHEMATICS | 2024年 / 9卷 / 02期
关键词
weighted network; Laplacian matrix; identification of key nodes; SIR model; robustness; POWER;
D O I
10.3934/math.2024178
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Identifying influential spreaders in complex networks is a crucial issue that can help control the propagation process in complex networks. An aviation network is a typical complex network, and accurately identifying the key city nodes in the aviation network can help us better prevent network attacks and control the spread of diseases. In this paper, a method for identifying key nodes in undirected weighted networks, called weighted Laplacian energy centrality, was proposed and applied to an aviation network constructed from real flight data. Based on the analysis of the topological structure of the network, the paper recognized critical cities in this network, then simulation experiments were conducted on key city nodes from the perspectives of network dynamics and robustness. The results indicated that, compared with other methods, weighted Laplacian energy centrality can identify the city nodes with the most spreading influence in the network. From the perspective of network robustness, the identified key nodes also have the characteristics of accurately and quickly destroying network robustness.
引用
收藏
页码:3630 / 3645
页数:16
相关论文
共 50 条
  • [31] A systematic survey of centrality measures for protein-protein interaction networks
    Ashtiani, Minoo
    Salehzadeh-Yazdi, Ali
    Razaghi-Moghadam, Zahra
    Hennig, Holger
    Wolkenhauer, Olaf
    Mirzaie, Mehdi
    Jafari, Mohieddin
    BMC SYSTEMS BIOLOGY, 2018, 12
  • [32] Normalized strength-degree centrality: identifying influential spreaders for weighted network
    Sadhu, Srestha
    Namtirtha, Amrita
    Malta, Mariana Curado
    Dutta, Animesh
    SOCIAL NETWORK ANALYSIS AND MINING, 2024, 14 (01)
  • [33] On measuring network robustness for weighted networks
    Zheng, Jianbing
    Gao, Ming
    Lim, Ee-Peng
    Lo, David
    Jin, Cheqing
    Zhou, Aoying
    KNOWLEDGE AND INFORMATION SYSTEMS, 2022, 64 (07) : 1967 - 1996
  • [34] On measuring network robustness for weighted networks
    Jianbing Zheng
    Ming Gao
    Ee-Peng Lim
    David Lo
    Cheqing Jin
    Aoying Zhou
    Knowledge and Information Systems, 2022, 64 : 1967 - 1996
  • [35] Centrality and shortest path length measures for the functional analysis of urban drainage networks
    Reyes-Silva, Julian D.
    Zischg, Jonatan
    Klinkhamer, Christopher
    Rao, P. Suresh C.
    Sitzenfrei, Robert
    Krebs, Peter
    APPLIED NETWORK SCIENCE, 2020, 5 (01)
  • [36] A network centrality measure framework for analyzing urban traffic flow: A case study of Wuhan, China
    Zhao, Shuangming
    Zhao, Pengxiang
    Cui, Yunfan
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2017, 478 : 143 - 157
  • [37] New Betweenness Centrality Node Attack Strategies for Real-World Complex Weighted Networks
    Quang Nguyen
    Ngoc-Kim-Khanh Nguyen
    Cassi, Davide
    Bellingeri, Michele
    COMPLEXITY, 2021, 2021
  • [38] Method to analyse the robustness of aviation communication network based on complex networks
    Zhang, Chao
    Zhang, Feng-Ming
    Wang, Ying
    Wu, Hu-Sheng
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2015, 37 (01): : 180 - 184
  • [39] Exploring the effectiveness of node attacks based on combined centrality measures in scale-free networks
    Divya, P. B.
    Johnson, T. P.
    Balakrishnan, Kannan
    Azad, N.
    JOURNAL OF COMPLEX NETWORKS, 2023, 11 (06)
  • [40] A new fast entropy-based method to generate composite centrality measures in complex networks
    Sabah, Levent
    Simsek, Mehmet
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2023, 35 (10)