Large subway systems as complex networks

Panagiotis Angeloudis and David Fisk

Physica A: Statistical Mechanics and its Applications, 2006, vol. 367, issue C, 553-558

Abstract: Analysis of the world's largest subway systems reveals two related classes of complex network that can be approximated by an evolutionary network with an associated exponential degree distribution. The characteristic high connectivity but low maximum vertex degree of these networks provides robustness to random attack, although one of the two classes is noticeably more vulnerable to targeted attack.

Keywords: Complex networks; Subways; Attack (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (60)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437105011994
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:367:y:2006:i:c:p:553-558

DOI: 10.1016/j.physa.2005.11.007

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().