Related papers: Traffic Light Queues and the Poisson Clumping Heur…
We study a single-lane traffic model that is based on human driving behavior. The outflow from a traffic jam self-organizes to a critical state of maximum throughput. Small perturbations of the outflow far downstream create emergent traffic…
Urban traffic is a logistic issue which can have many societal implications, especially when, due to a too high density of cars, the network of streets of a city becomes blocked, and consequently, pedestrians, bicycles, and cars start…
In the supermarket model there are n queues, each with a unit rate server. Customers arrive in a Poisson process at rate \lambda n, where 0<\lambda <1. Each customer chooses d > 2 queues uniformly at random, and joins a shortest one. It is…
We describe traffic flows in one lane roadways using kinetic theory, with special emphasis on the role of quenched randomness in the velocity distributions. When passing is forbidden, growing clusters are formed behind slow cars and the…
We present a microscopic driving algorithm that prescribes the acceleration using three parameters: the distance to the leading vehicle, to the next traffic light and to the nearest stopping point when the next traffic light is in the red…
In discrete time, customers arrive at random. Each waits until one of three servers is available; each thereafter departs at random. We seek the distribution of maximum line length of idle customers. Algebraic expressions obtained for the…
Developments in sensor technologies, especially emerging connected and autonomous vehicles, facilitate better queue length (QL) measurements on signalized intersection approaches in real time. Currently there are very limited methods that…
We study the asymptotic behavior of the maximum interpoint distance of random points in a $d$-dimensional set with a unique diameter and a smooth boundary at the poles. Instead of investigating only a fixed number of $n$ points as $n$ tends…
We present in this paper a method to estimate urban traffic state with communicating vehicles. Vehicles moving on the links of the urban road network form queues at the traffic lights. We assume that a proportion of vehicles are equipped…
Initially a car is placed with probability p at each site of the two-dimensional integer lattice. Each car is equally likely to be East-facing or North-facing, and different sites receive independent assignments. At odd time steps, each…
During the attempt to line up into a dense traffic people have necessarily to share a limited space under turbulent conditions. From the statistical point view it generally leads to a probability distribution of the distances between the…
We study completely asymmetric 2-channel exclusion processes in 1 dimension. It describes a two-way traffic flow with cars moving in opposite directions. The interchannel interaction makes cars slow down in the vicinity of approaching cars…
We consider the length of {\em ordered loose paths} in the random $r$-uniform hypergraph $H=H^{(r)}(n, p)$. A ordered loose path is a sequence of edges $E_1,E_2,\ldots,E_\ell$ where $\max\{j\in E_i\}=\min\{j\in E_{i+1}\}$ for $1\leq…
Statistical mechanics of a small system of cars on a single-lane road is developed. The system is not characterized by a Hamiltonian but by a conditional probability of a velocity of a car for the given velocity and distance of the car…
We present an algorithmic method for analyzing networks of intersections with static signaling, with as primary example a line network that allows traffic flow over several intersections in one main direction. The method decomposes the…
We discuss numerical strategies to deal with PDE systems describing traffic flows, taking into account a density threshold, which restricts the vehicles density in the situation of congestion. These models are obtained through asymptotic…
We study a single server FIFO queue that offers general service. Each of n customers enter the queue at random time epochs that are inde- pendent and identically distributed. We call this the random scattering traffic model, and the…
A two--dimensional cellular automaton is introduced to model the flow and jamming of vehicular traffic in cities. Each site of the automaton represents a crossing where a finite number of cars can wait approaching the crossing from each of…
This paper studies the asymptotic behavior of the steady-state waiting time, W_infty, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide…
Consider the continuous greedy paths model: given a $d$-dimensional Poisson point process with positive marks interpreted as masses, let $\mathrm P(\ell)$ denote the maximum mass gathered by a path of length $\ell$ starting from the origin.…