First-passage processes in a deterministic one-dimensional cellular automaton model of traffic flow
Ofer Biham, Gilad Hertzberg Rabinovich, Eytan Katzav

TL;DR
This paper derives analytical expressions for first-passage times and stopping probabilities in a deterministic 1D cellular automaton traffic model, revealing phase transition behavior and congestion dynamics.
Contribution
It provides the first closed-form solutions for first-stopping and last-stopping time distributions in a CA traffic model, linking microscopic car behavior to macroscopic phase transition.
Findings
Closed-form expression for first-stopping time distribution
Identification of a phase transition at car density p=1/2
Analysis of congestion and relaxation time scales
Abstract
We present analytical results for first-passage processes in a deterministic one-dimensional cellular automaton (CA) model of traffic flow. Starting at time from a random initial state with car density p, at every time step each car moves one step to the right if the cell on its right is empty, and is stopped if it is occupied by another car. The model, which coincides with CA rule 184 in Wolfram's numbering scheme, exhibits a continuous dynamical phase transition at , between a low-density free-flowing phase and a high-density congested phase. Using the framework of first-passage processes, we derive a closed-form expression for the distribution of first-stopping (FS) times, which is the probability that a randomly selected car will be stopped for the first time at time . We also obtain a closed-form expression for the stopping probability…
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.
