Related Experiment Video
Updated: Aug 28, 2025

Evaluating the Effect of Roadside Parking on a Dual-Direction Urban Street
Published on: January 20, 2023
Cascading traffic jamming in a two-dimensional Motter and Lai model
Gabriel Cwilich1,2, Sergey V Buldyrev1
1Department of Physics, Yeshiva University, 500 West 185th Street, New York, New York 10033, USA.
Insights
We investigated cascading traffic jamming on random geometric graphs. A critical attack size causes complete network jamming, dependent on graph properties and the Motter and Lai model
Area of Science:
- Network science
- Complex systems analysis
- Traffic flow dynamics
Background:
- Cascading failures are critical in network robustness.
- Understanding traffic jamming dynamics is essential for network resilience.
- The Motter and Lai model provides a framework for studying cascading effects.
Purpose of the Study:
- To investigate cascading traffic jamming on two-dimensional random geometric graphs.
- To determine the critical attack size leading to complete network jamming.
- To analyze the influence of average degree, system size, and tolerance on jamming.
Main Methods:
- Utilizing the Motter and Lai model for simulation.
- Analyzing localized (circular/line) and dispersed node attacks.
- Examining network behavior under varying attack sizes and parameters.
Main Results:
- A critical attack size was identified, triggering complete network jamming.
- The critical size is influenced by the average degree (〈k〉) of the graph.
- The number of nodes (N) and tolerance parameter (α) significantly affect the jamming threshold.
Conclusions:
- Network jamming can be triggered by attacks of a critical size.
- Network topology and model parameters dictate vulnerability to cascading failures.
- Findings inform strategies for enhancing network resilience against targeted disruptions.
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 a 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 〈k〉 of the graph, on the number of nodes N in the system, and the tolerance parameter α of the Motter and Lai model.
Related Concept Videos
Laminar Flow: Problem Solving
Uniform Depth Channel Flow: Problem Solving
Two-Dimensional Force System: Problem Solving
The first step to solving a two-dimensional force system problem is to draw a free-body diagram of the object under consideration. This diagram helps identify all the external forces acting on the object, including their...
Bernoulli's Equation for Flow Along a Streamline
Design Example: Forces in Sluice Gate
Key variables in...
Typical Model Studies

