Emergence of Scale-Free Traffic Jams in Highway Networks: A Probabilistic Approach

TL;DR

This work addresses why traffic jams in large highway networks exhibit scale-free statistics by linking the scale-free distribution of city-level traffic intensities to the tail of the congestion cost via a probabilistic cascade model. It proves that if vertex weights have a Pareto tail with exponent $\alpha$, then the final congestion-cost tail also follows $\mathbb{P}(\Delta c_f^{(end)}>y)\sim C^{(end)} y^{-\alpha}$, with the same $\alpha$ across cascade stages, while the prefactor $C^{(end)}$ depends on the cascade mechanism. The catastrophe principle shows that extreme jams are typically driven by a single large vertex, and the exponent is robust to network configuration and propagation rules, matching observed universality in data and simulations. Empirical Dutch data support scale-free behavior in both traffic intensity and jam lengths, and the framework suggests targeted interventions aimed at the underlying city-size distribution to mitigate extreme congestion events.

Abstract

Traffic congestion continues to escalate with urbanization and socioeconomic development, necessitating advanced modeling to understand and mitigate its impacts. In large-scale networks, traffic congestion can be studied using cascade models, where congestion not only impacts isolated segments, but also propagates through the network in a domino-like fashion. One metric for understanding these impacts is congestion cost, which is typically defined as the additional travel time caused by traffic jams. Recent data suggests that congestion cost exhibits a universal scale-free-tailed behavior. However, the mechanism driving this phenomenon is not yet well understood. To address this gap, we propose a stochastic cascade model of traffic congestion. We show that traffic congestion cost is driven by the scale-free distribution of traffic intensities. This arises from the catastrophe principle, implying that severe congestion is likely caused by disproportionately large traffic originating from a single location. We also show that the scale-free nature of congestion cost is robust to various congestion propagation rules, explaining the universal scaling observed in empirical data. These findings provide a new perspective in understanding the fundamental drivers of traffic congestion and offer a unifying framework for studying congestion phenomena across diverse traffic networks.

Figures (6)

• Figure 1: The traffic intensity and the average length of traffic jams on Dutch highways exhibit scale-free behavior. The full description of the data analysis is provided in Appendix \ref{['DataAnalysis']}.
• Figure 2: Flow diagram of disruption cascade. One loop in the process corresponds to a single cascade stage, denoted by $r$.
• Figure 3: A cascade example initiated by the congestion on edge $(1,2)$. Here, edge exceedance is the fraction of the flow over flow capacity on the edge.
• Figure 4: Congestion simulation in the example graph.
• Figure 5: Plots of congestion simulation in the example graph for two vertex weight scenarios.

Theorems & Definitions (30)

• Theorem 2.1
• Proposition 2.2
• Lemma D.1: Scale-invariance of $\bm{\bar{f}}^{(0)}$
• proof
• Lemma D.2
• proof
• Corollary D.3
• proof
• Lemma D.4
• proof