Public Transport Networks under Random Failure and Directed Attack
Bertrand Berche, Christian von Ferber, Taras Holovatch, Yurij, Holovatch

TL;DR
This paper investigates the vulnerability of public transport networks modeled as scale-free graphs, analyzing how random failures and targeted attacks affect their structural integrity and identifying minimal high-impact attack strategies.
Contribution
It introduces vulnerability criteria for public transport networks and evaluates the effects of directed attacks using simulations, highlighting their susceptibility.
Findings
Scale-free behavior observed in city transport networks
Targeted attacks significantly disrupt network connectivity
Minimal attack strategies can cause high impact
Abstract
The behaviour of complex networks under failure or attack depends strongly on the specific scenario. Of special interest are scale-free networks, which are usually seen as robust under random failure but appear to be especially vulnerable to targeted attacks. In a recent study of public transport networks of 14 major cities of the world we have shown that these systems when represented by appropriate graphs may exhibit scale-free behaviour. In this paper we briefly review some of the recent results about the effects that defunct or removed nodes have on the properties of public transport networks. Simulating different directed attack strategies, we derive vulnerability criteria that result in minimal strategies with high impact on these systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Graph theory and applications · Stochastic processes and statistical mechanics
