Searcharxiv⌕ Search

arXiv · 2610.23022

Stochastic Shockwave Dynamics in First-Order Traffic Flow

Abstract

Moving congestion fronts vary across realizations even when the traffic-flow law is fixed. This paper develops a generator-based formulation of the Lighthill--Whitham--Richards (LWR) model with random initial density and a deterministic fundamental diagram. Randomness enters through the initial spatial density field; every realization follows the same conservation law. For a smooth strictly concave fundamental diagram, we adapt established one-sided spatial Markov closure to traffic variables under the stated spatial-process and regularity assumptions, and derive a kinetic balance for physically normalized front intensities. Evolving the spatial generator provides density laws and congestion-front statistics without solving a road-grid problem for every realization. The formulation is continuous in physical space and time, while its numerical implementation approximates density state and integrates physical time. Four experiments distinguish deterministic consistency from stochastic comparison. Riemann and signal examples recover independently constructed exact LWR solutions. Smooth strictly concave approximations approach the deterministic triangular-diagram signal solution over the tested finite horizons; this does not establish stochastic closure at contacts or the capacity kink. A matched Monte Carlo Godunov ensemble evaluates front counts, sizes, mergers, and density distributions. The evolved generator also yields an instantaneous travel-time distribution for a frozen density field, compared with the same functional of the matched Godunov profiles. This quantity is not experienced travel time through evolving traffic. Resolution checks identify remaining normalization and small-front-loss effects. The contribution is direct evolution and interpretation of traffic-state and front distributions under a fixed first-order traffic law.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yanlin Zhang, Alireza Talebpour. 2026-10-16. Stochastic Shockwave Dynamics in First-Order Traffic Flow. https://arxiv.org/abs/2610.23022

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fairness, Travel, and Market Potential: An Optimization Framework for NBA Expansion

The potential expansion of the National Basketball Association (NBA) to 32 teams raises the question of how to restructure its conferences and divisions while balancing travel efficiency, fairness in team travel burdens, and commercial exposure. This study provides a quantitative framework for expansion planning. We develop two optimization models: one minimizing total travel distance and another following the Kalai-Smorodinsky (KS) proportional-improvement principle. The KS model maximizes the smallest normalized travel improvement between a team's fixed reference and individual ideal. Both models incorporate an opponent-exposure constraint to account for commercial considerations, and take into account road trips when measuring travel distance. Using data from all 30 current franchises and six candidate cities (Seattle, Las Vegas, Montreal, Vancouver, Tampa, and Mexico City), we evaluate 15 pairwise expansion scenarios under alternative season lengths and divisional formats. In the 30-team comparison, KS strikes a good balance between overall travel efficiency and fairness across teams, giving greater attention to individual travel burdens while keeping total travel close to the distance-minimizing solution. The expansion results show that travel requirements depend jointly on the candidate city pair and the competition format, highlighting the need to assess expansion and realignment together. Our study offers a flexible decision support framework for league executives, policymakers, and sports economists. It makes the trade-offs between total travel, individual gains, and opponent exposure explicit, providing evidence-based guidance for strategic league design.

physics.soc-ph↗

Modeling inhomogeneous spatial point configurations with applications to replicated patterns in real-life waiting crowds

In this article, we connect statistical inference for spatial point processes with the analysis of waiting pedestrian crowds through two interconnected contributions. First, on the methodological side we develop an inference procedure for semiparametric spatial point process models leveraging replicated spatial patterns, i.e., multiple approximately independent realizations from the same process. Second, we show that spatial point processes provide a suitable modeling framework for waiting pedestrians, capturing two key aspects: spatial inhomogeneity driven by location attractiveness and repulsive interactions between pedestrians. These two components are central to the inference problem itself, since spatial point process modeling hinges on disentangling background intensity from interaction. Although replicated spatial patterns are rare in point process literature, they are available here through a unique real-life pedestrian dataset, thereby directly linking the methodological development to the physical application. We use the proposed methods to fit and evaluate determinantal and Gibbs point processes in a simulation study and a real-world case study. Despite persistent challenges in decoupling the influences of inhomogeneity from interaction, these models are able to reproduce key empirical features of waiting pedestrians.

physics.soc-ph↗

Predictability of Human Movements across Industry Sectors using Multilayer Networks

Predicting the patterns of human movement is important to applications from urban design to disease control and emergency response. In this work, we leverage machine learning (ML) to study the predictability of movements to different types of locations (e.g., movements to grocery stores, to schools, or to hospitals). Our approach relies on developing multilayer mobility networks encoding movements between census tracts with network layers associated with different industry sectors. We study the predictability of node degrees across layers, studying which industries are easier/harder to predict. Rather than treat prediction as an end in itself, we propose ML predictability as an exploratory tool to understand multilayer network organization. Our results suggest that node's out-degrees are easy to predict, since they are driven by census tract populations; whereas in-degrees are harder to predict, since persons can be drawn to diverse type of locations in a census tract. We also find that movements to certain industry types (e.g., restaurants) are easier to predict than others, and the different industrie's predictability are positively correlated with the number of movements to those types of locations. These findings provide a practical step toward using ML for multilayer mobility modeling and the many downstream application.

physics.soc-ph↗