Traffic Light Queues and the Poisson Clumping Heuristic
classification
🧮 math.PR
math.HO
keywords
blockscarslightsarriveasymptoticsclumpingconjectureddiscrete
read the original abstract
In discrete time, $\ell$-blocks of red lights are separated by $\ell$-blocks of green lights. Cars arrive at random. We seek the distribution of maximum line length of idle cars, and justify conjectured probabilistic asymptotics for $2 \leq \ell \leq 3$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.