Finding influential nodes in bus networks

被引:3
作者
Zhang, Hui [1 ]
Shi, Baiying [1 ]
Yu, Xiaohua [1 ]
Li, Meiling [1 ]
Song, Shuguang [1 ]
Zhao, Quanman [1 ]
Yao, Xiangming [2 ]
Wang, Wei [3 ]
机构
[1] Shandong Jianzhu Univ, Sch Transportat Engn, Jinan 250101, Shandong, Peoples R China
[2] Beijing Jiaotong Univ, Sch Traff & Transportat, Beijing 100044, Peoples R China
[3] Ocean Univ China, Sch Econ, Qingdao 266100, Shandong, Peoples R China
来源
INTERNATIONAL JOURNAL OF MODERN PHYSICS B | 2018年 / 32卷 / 28期
基金
中国国家自然科学基金;
关键词
Bus networks; complex network; influential nodes; network efficiency; transfer times; COMPLEX NETWORKS; KEY NODES; IDENTIFICATION; SIMILARITY;
D O I
10.1142/S0217979218503113
中图分类号
O59 [应用物理学];
学科分类号
摘要
Finding influential nodes is of significance to understand and control the spreading capacity of complex systems. This paper aims to find influential nodes of bus networks by a proposed node failure process. Network efficiency and average transfer times are used to measure the performance of bus networks. Six node measures including degree, node strength, line number, betweenness, local triangle centrality (LTC) and a measure considering neighborhood similarity called LSS are introduced to evaluate the importance of nodes. Results show that removing nodes with high betweenness value can effectively decrease the network efficiency, but cannot increase the average transfer times. Furthermore, removing nodes with high values of LTC and LSS considering the neighborhood information can damage the bus networks from the perspectives of both network efficiency and average transfer times.
引用
收藏
页数:13
相关论文
共 33 条
  • [1] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [2] Identifying influential nodes in complex networks: A node information dimension approach
    Bian, Tian
    Deng, Yong
    [J]. CHAOS, 2018, 28 (04)
  • [3] Statistical Analysis of Bus Networks in India
    Chatterjee, Atanu
    Manohar, Manju
    Ramadurai, Gitakrishnan
    [J]. PLOS ONE, 2016, 11 (12):
  • [4] Public Transit Hubs Identification Based on Complex Networks Theory
    Chen, Dongming
    Huang, Xinyu
    Wang, Dongqi
    Jia, Lulu
    [J]. IETE TECHNICAL REVIEW, 2014, 31 (06) : 440 - 451
  • [5] Identifying influential nodes in complex networks
    Chen, Duanbing
    Lu, Linyuan
    Shang, Ming-Sheng
    Zhang, Yi-Cheng
    Zhou, Tao
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) : 1777 - 1787
  • [6] Role of centrality for the identification of influential spreaders in complex networks
    de Arruda, Guilherme Ferraz
    Barbieri, Andre Luiz
    Rodriguez, Pablo Martin
    Rodrigues, Francisco A.
    Moreno, Yamir
    Costa, Luciano da Fontoura
    [J]. PHYSICAL REVIEW E, 2014, 90 (03)
  • [7] Identifying node importance based on information entropy in complex networks
    Fan Wenli
    Liu Zhigang
    Hu Ping
    [J]. PHYSICA SCRIPTA, 2013, 88 (06)
  • [8] Survivability of public transit network based on network structure entropy
    Fu, Bai-Bai
    Zhang, Lin
    Li, Shu-Bin
    Li, Yun-Xuan
    [J]. INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2015, 26 (09):
  • [9] Multi-node attack strategy of complex networks due to cascading breakdown
    Fu Chaoqi
    Wang Ying
    Wang Xiaoyang
    Gao Yangjun
    [J]. CHAOS SOLITONS & FRACTALS, 2018, 106 : 61 - 66
  • [10] Ranking the spreading ability of nodes in complex networks based on local structure
    Gao, Shuai
    Ma, Jun
    Chen, Zhumin
    Wang, Guanghui
    Xing, Changming
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 403 : 130 - 147