Related papers: Traffic Light Queues and the Poisson Clumping Heur…
Consider the extreme value of a Bernoulli random walk on the one-dimensional integer lattice, with reflection at 0, over a finite discrete time interval. Only the asymmetric (biased) case is discussed. Asymptotic mean/variance results are…
We give a simple derivation of the distribution of the maximum L of the length of the queue during a busy period for the M/M/1 queue with lambda<1 the ratio between arrival rate and service rate. We observe that the asymptotic behavior of…
This paper presents two one-dimensional mathematical models describing automobile traffic flow on straight road segments at a signalized intersection. When the traffic light is permissive, the flow density and velocity are obtained by…
We study the dynamics of three elastic particles in a finite interval where two light particles are separated by a heavy ``piston''. The piston undergoes surprisingly complex motion that is oscillatory at short time scales but seemingly…
Within the framework of a simple model of car traffic on a one-lane highway, we study the probability for car accidents to occur when drivers do not respect the safety distance between cars, and, as a result of the blockage during the time…
Simple physical models based on fluid mechanics have long been used to understand the flow of vehicular traffic on freeways; analytically tractable models of flow on an urban grid, however, have not been as extensively explored. In an ideal…
In a city of right moving and upmoving cars with hardcore constraint, traffic jam occurs in the form of bands. We show how the bands are destroyed by a small number of strictly left moving cars yielding a deadlock phase with a rough edge of…
The traffic flow through a light signal is explored by using the optimal velocity model and its improvement known as full velocity differences model. The simulations consider a single line of identical cars, equally spaced, and with no…
We consider two variations of the discrete car parking problem where at every vertex of the integers a car arrives with rate one, now allowing for parking in two lines. a) The car parks in the first line whenever the vertex and all of its…
We propose a model for the intersection of two urban streets. The traffic status of the crossroads is controlled by a set of traffic lights which periodically switch to red and green with a total period of T. Two different types of…
This paper discusses the real-time prediction of queue lengths from probe vehicles for the Bunch arrival headways at an isolated intersection for undersaturated conditions. The paper incorporates the bunching effect of the traffic into the…
In this paper, we study a distribution of labeled particles on a continuous ring. It arises in three different ways, all related to the multi-type TASEP on a ring. We prove formulas for the probability density function for some permutations…
We propose a model for the intersection of two urban streets. The traffic status of the crossroads is controlled by a set of traffic lights which periodically switch to red and green with a total period of T. Two different types of…
We consider multi-component matching systems in heavy traffic consisting of $K\geq 2$ distinct perishable components which arrive randomly over time at high speed at the assemble-to-order station, and they wait in their respective queues…
In this expository note, we give a short derivation of the expected number of collisions between two independent simple random walkers on integer lattices. Adapting a Poissonization technique introduced by Lange, we express the collision…
Optimal traffic-light settings are generally hard to obtain, certainly for actuated access control of an intersection. Typically, computationally expensive (microscopic) simulations or complicated optimization schemes are required to find…
Many discrete-time optimal stopping problems are known to have more tractable limit forms based on a planar Poisson process. Using this tool we find a solution to the optimal stopping problem for i.i.d. sequence of $n$ discrete uniform…
This note describes several open questions concerning scaling limits of queue-length processes of symmetric queues in heavy traffic, distinguishing between service-time distributions with finite and infinite variance.
Interaction between vehicles and pedestrians is seen in many areas such as crosswalks and intersections. In this paper, we study a totally asymmetric simple exclusion process with a bottleneck at a boundary caused by an interaction. Due to…
In this paper we investigate Gaussian queues in the light-traffic and in the heavy-traffic regime. The setting considered is that of a centered Gaussian process $X\equiv\{X(t):t\in\mathbb R\}$ with stationary increments and variance…