Related papers: Analytical Results for a Small Multiple-layer Park…
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…
We use a new version of the reversible Parking Lot Model to study the compaction of vibrated polydisperse media. The particle sizes are distributed according to a truncated power law. We introduce a self-consistent desorption mechanism with…
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…
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…
We analyze mean-field equations obtained for models motivated by a large station-based car-sharing system in France called Autolib. The main focus is on a version where users reserve a parking space when they take a car. In a first model,…
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…
In this paper, we consider hashing with linear probing for a hashing table with m places, n items (n < m), and l = m<n empty places. For a non computer science-minded reader, we shall use the metaphore of n cars parking on m places: each…
We present a theoretical discussion of the reversible parking problem, which appears to be one of the simplest systems exhibiting glassy behavior. The existence of slow relaxation, nontrivial fluctuations, and an annealing effect can all be…
We study the asymptotic behavior of cycles of uniformly random parking functions. Our results are multifold: we obtain an explicit formula for the number of parking functions with a prescribed number of cyclic points and show that the…
In the classical parking problem, unit intervals ("car lengths") are placed uniformly at random without overlapping. The process terminates at saturation, i.e. until no more unit intervals can be stowed. In this paper, we present a…
The problem of reservation in a large distributed system is analyzed via a new mathematical model. A typical application is a station-based car-sharing system which can be described as a closed stochastic network where the nodes are the…
We consider a class of interacting particle systems with values in $[0,\8)^{\zd}$, of which the binary contact path process is an example. For $d \ge 3$ and under a certain square integrability condition on the total number of the…
In this paper, we investigate a parking process on a uniform random rooted plane tree with $n$ vertices. Every vertex of the tree has a parking space for a single car. Cars arrive at independent uniformly random vertices of the tree. If the…
Consider the following simple parking process on $\Lambda_n := \{-n, \ldots, n\}^d,d\ge1$: at each step, a site $i$ is chosen at random in $\Lambda_n$ and if $i$ and all its nearest neighbor sites are empty, $i$ is occupied. Once occupied,…
In this article, we establish new results on the probabilistic parking model (introduced by Durm\'ic, Han, Harris, Ribeiro, and Yin) with $m$ cars and $n$ parking spots and probability parameter $p\in[0,1]$. For any $ m \leq n$ and $p \in…
We discuss asymptotics for large random planar maps under the assumption that the distribution of the degree of a typical face is in the domain of attraction of a stable distribution with index $\alpha\in(1,2)$. When the number $n$ of…
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…
In the Page parking (or packing) model on a discrete interval (also known as the discrete R{\'e}nyi packing problem or the unfriendly seating problem), cars of length two successively park uniformly at random on pairs of adjacent places,…
This paper examines the traffic flows on a two-dimensional stochastic lattice model that comprises a junction of two traveling routes: the domestic route and the international route each of which has parking sites. In our model, the system…
We present an algorithm to simulate random sequential adsorption (random "parking") of discs on constant-curvature surfaces: the plane, sphere, hyperboloid, and projective plane, all embedded in three-dimensional space. We simulate complete…