Robustness analysis model of urban transit networks

被引:0
作者
Duan H.-L. [1 ]
Li Z.-H. [1 ]
Zhang Y. [1 ]
机构
[1] Department of Automation, Tsinghua University
来源
Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science) | 2010年 / 38卷 / 03期
关键词
Bipartite graph model; Complex network; Robustness analysis; Urban transit network;
D O I
10.3969/j.issn.1000-565X.2010.03.013
中图分类号
学科分类号
摘要
The analysis of robustness, an important performance index of urban transit networks, helps to well evaluate and optimize the measures of urban transit systems. In this paper, first, three models of urban transit systems respectively for the original transit network, the transit station network and the transit line network are established based on the bipartite graph model, and a robustness index of the topology structure of urban transit networks is defined. Then, a fast algorithm is proposed for the robustness analysis of large-scale networks. Finally, the robustness of the three established models is analyzed, with Beijing transit system under random and intentional attacks as an example. The results indicate that, compared with the random network, the urban transit network is not sensitive to the random attack, but somewhat sensitive to degree-based and betweenness-based attack.
引用
收藏
页码:70 / 75+81
相关论文
共 9 条
  • [1] Wu J.J., Gao Z.Y., Sun H.J., Et al., Urban transit as a scale free network, Modern Physics Letter B, 18, pp. 1043-1049, (2004)
  • [2] Albert R., Jeong H., Barabasi A.L., Error and attack tolerance of complex networks, Nature, 406, pp. 378-382, (2000)
  • [3] Cohen R., Erez K., Ben-Avraham D., Et al., Resilience of the internet to random breakdowns, Phys Rev Lett, 85, 21, pp. 4626-4628, (2000)
  • [4] Cohen R., Erez K., Ben-Avraham D., Et al., Breakdown of the internet under intentional attack, Phys Rev Lett, 86, 16, pp. 3682-3686, (2001)
  • [5] Bollobas B., Riordan O., Robustness and vulnerability of scalefree random graphs, Internet Math, 1, pp. 1-35, (2003)
  • [6] He S.-X., Fan B.-Q., From urban transit networks to various complex networks, Journal of Systems Engineering, 22, 6, pp. 599-606, (2007)
  • [7] Newman M.E.J., Watts D.J., Strogatz S.H., Random graph models of social networks, Proceedings, National Academy of Sciences, 99, pp. 2566-2572, (2002)
  • [8] Albert R., Barabasi A.L., Statistic mechanics of complex networks, Review of Modern Physics, 74, pp. 47-97, (2002)
  • [9] Von Ferber C., Holovatch Y., Palchykov D., Scaling in public transport networks, Condens Matter Phys, 8, pp. 225-234, (2005)