中国物理B ›› 2023, Vol. 32 ›› Issue (9): 98903-098903.doi: 10.1088/1674-1056/acd3e2

• • 上一篇    下一篇

Self-similarity of complex networks under centrality-based node removal strategy

Dan Chen(陈单)1,2, Defu Cai(蔡德福)3, and Housheng Su(苏厚胜)1,2,†   

  1. 1 School of Artificial Intelligence and Automation, Huazhong University of Science and Technology, Wuhan 430074, China;
    2 Institute of Artificial Intelligence, Huazhong University of Science and Technology, Wuhan 430074, China;
    3 State Grid Hubei Electric Power Research Institute, Wuhan 430077, China
  • 收稿日期:2023-03-24 修回日期:2023-04-26 接受日期:2023-05-10 发布日期:2023-08-28
  • 通讯作者: Housheng Su E-mail:houshengsu@gmail.com
  • 基金资助:
    Project supported by the Science and Technology Project of State Grid Corporation of China (Grant No. 5100- 202199557A-0-5-ZN).

Self-similarity of complex networks under centrality-based node removal strategy

Dan Chen(陈单)1,2, Defu Cai(蔡德福)3, and Housheng Su(苏厚胜)1,2,†   

  1. 1 School of Artificial Intelligence and Automation, Huazhong University of Science and Technology, Wuhan 430074, China;
    2 Institute of Artificial Intelligence, Huazhong University of Science and Technology, Wuhan 430074, China;
    3 State Grid Hubei Electric Power Research Institute, Wuhan 430077, China
  • Received:2023-03-24 Revised:2023-04-26 Accepted:2023-05-10 Published:2023-08-28
  • Contact: Housheng Su E-mail:houshengsu@gmail.com
  • Supported by:
    Project supported by the Science and Technology Project of State Grid Corporation of China (Grant No. 5100- 202199557A-0-5-ZN).

摘要: Real-world networks exhibit complex topological interactions that pose a significant computational challenge to analyses of such networks. Due to limited resources, there is an urgent need to develop dimensionality reduction techniques that can significantly reduce the structural complexity of initial large-scale networks. In this paper, we propose a subgraph extraction method based on the node centrality measure to reduce the size of the initial network topology. Specifically, nodes with smaller centrality value are removed from the initial network to obtain a subgraph with a smaller size. Our results demonstrate that various real-world networks, including power grids, technology, transportation, biology, social, and language networks, exhibit self-similarity behavior during the reduction process. The present results reveal the self-similarity and scale invariance of real-world networks from a different perspective and also provide an effective guide for simplifying the topology of large-scale networks.

关键词: complex networks, subgraph extraction, self-similarity, scale invariance

Abstract: Real-world networks exhibit complex topological interactions that pose a significant computational challenge to analyses of such networks. Due to limited resources, there is an urgent need to develop dimensionality reduction techniques that can significantly reduce the structural complexity of initial large-scale networks. In this paper, we propose a subgraph extraction method based on the node centrality measure to reduce the size of the initial network topology. Specifically, nodes with smaller centrality value are removed from the initial network to obtain a subgraph with a smaller size. Our results demonstrate that various real-world networks, including power grids, technology, transportation, biology, social, and language networks, exhibit self-similarity behavior during the reduction process. The present results reveal the self-similarity and scale invariance of real-world networks from a different perspective and also provide an effective guide for simplifying the topology of large-scale networks.

Key words: complex networks, subgraph extraction, self-similarity, scale invariance

中图分类号:  (Complex systems)

  • 89.75.-k
89.75.Fb (Structures and organization in complex systems) 89.75.Hc (Networks and genealogical trees)