Related papers: A second row Parking Paradox
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 propose a generalized car parking problem where either a car of size $\sigma$ or of size $m\sigma$ ($m>1$) is sequentially parked on a line with probability $q$ and $(1-q)$, respectively. The free parameter $q$ interpolates between the…
This paper considers an unsignalized intersection used by two traffic streams. A stream of cars is using a primary road, and has priority over the other, low-priority, stream. Cars belonging to the latter stream cross the primary road if…
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…
Place a car independently with probability $p$ at each site of a graph. Each initially vacant site is a parking spot that can fit one car. Cars simultaneously perform independent random walks. When a car encounters an available parking spot…
We study the parking process on the random recursive tree. We first prove that although the random recursive tree has a non-degenerate Benjamini--Schramm limit, the phase transition for the parking process appears at density $0$. We then…
The rise of electric vehicles (EVs) is unstoppable due to factors such as the decreasing cost of batteries and various policy decisions. These vehicles need to be charged and will therefore cause congestion in local distribution grids in…
Classical second order models of pedestrian dynamics, like the social-force model, suffer from various unrealistic behaviors in the dynamics, e.g. backward motion, oscillations and overlapping of pedestrians. These effects are not related…
We consider a system of ordered cars moving in $\R$ from right to left. Each car is represented by a point in $\R$; two or more cars can occupy the same point but cannot overpass. Cars have two possible velocities: either 0 or 1. An…
We investigate the behaviour of an original traffic model. The model considers a single multi-lane street, populated by autonomous vehicles directed from either end to the other. Lanes have no intrinsic directionality, and the vehicles are…
Consider $n$ cars $C_1, C_2, \ldots, C_n$ that want to park in a parking lot with parking spaces $1,2,\ldots,n$ that appear in order. Each car $C_i$ has a parking preference $\alpha_i \in \{1,2,\ldots,n\}$. The cars appear in order, if…
We extend the Aw-Rascle macroscopic model of car traffic into a two-way multi-lane model of pedestrian traffic. Within this model, we propose a technique for the handling of the congestion constraint, i.e. the fact that the pedestrian…
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…
An asymmetric exclusion process type process, where cars move forward along a closed road that starts and terminates at a parking garage, displays dynamic phase transitions into two types of condensate phases where the garage becomes…
In parking problems, a given number of cars enter a one-way street sequentially, and try to park according to a specified preferred spot in the street. Various models are possible depending on the chosen rule for collisions, when two cars…
This contribution analyzes the widely used and well-known "intelligent driver model (briefly IDM), which is a second order car-following model governed by a system of ordinary differential equations. Although this model was intensively…
Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If…
In the parking model on $\mathbb{Z}^d$, each vertex is initially occupied by a car (with probability $p$) or by a vacant parking spot (with probability $1-p$). Cars perform independent random walks and when they enter a vacant spot, they…
Parking functions, classically defined in terms of cars with preferred parking spots on a directed path attempting to park there, arise in many combinatorial situations and have seen various generalizations. In particular, parking functions…
In this article a multilayer parking system with screening of size n=3 is studied with a focus on the time-dependent particle density. We prove that the asymptotic limit of the particle density increases from an average density of 1/3 on…