Cascading traffic jamming in a two-dimensional Motter and Lai model
arXiv:2204.09011 · doi:10.1103/PhysRevE.106.024303
Abstract
We study the cascading traffic jamming on a two-dimensional random geometric graph using the Motter and Lai model. The traffic jam is caused by a localized attack incapacitating circular region or a line of a certain size, as well as a dispersed attack on an equal number of randomly selected nodes. We investigate if there is a critical size of the attack above which the network becomes completely jammed due to cascading jamming, and how this critical size depends on the average degree of the graph, on the number of nodes in the system, and the tolerance parameter of the Motter and Lai model.
arXiv comment14 pages, 9 figures
References in corpus (8)
- Cascade-based attacks on complex networks
- Cascade control and defense in complex networks
- Small vulnerable sets determine large network cascades in power grids
- Spatially localized attacks on interdependent networks: the existence of a finite critical attack size
- Spreading of localized attacks in spatial multiplex networks
- Network Overload due to Massive Attacks
- Distribution of blackouts in the power grid and the Motter and Lai model
- Cascading failures in isotropic and anisotropic spatial networks induced by localized attacks and overloads