相关论文: Exhaustion of an interval by iterated Renyi parkin…
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,…
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…
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…
Models of parking in which cars are placed randomly and then move according to a deterministic rule have been studied since the work of Konheim and Weiss in the 1960s. Recently, Damron, Gravner, Junge, Lyu, and Sivakoff introduced a model…
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…
We compute the correlation function in the equilibrium version of R\'enyi's {\sl parking problem}. The correlation length is found to diverge as $2^{-1}\pi^{-2}(1-\rho)^{-2}$ when $\rho\nearrow1$ (maximum density) and as…
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking…
A highly accurate and efficient method to compute the expected values of the count, sum, and squared norm of the sum of the centre vectors of a random maximal sized collection of non-overlapping unit diameter disks touching a fixed…
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 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…
All over the world, especially in the university environment, planning managers and traffic engineers are constantly faced with the problem of inadequate allocation of car parking spaces to demanded users. Users could either prefer reserved…
We extend the notion of parking functions to parking sequences, which include cars of different sizes, and prove a product formula for the number of such sequences.
In the standard formulation of the occupancy problem one considers the distribution of r balls in n cells, with each ball assigned independently to a given cell with probability 1/n. Although closed form expressions can be given for the…
Renyi entropy with multiple disjoint intervals are computed from the improved swapping operations by two methods: one is from the direct diagonalization of the Hamiltonian and the other one is from the state-of-the-art machine learning…
An exhaustive analysis of the leaky tank car problem is presented, pointing out its intriguing physical properties, which well serve to students and teachers for illustrating standard Newtonian mechanics in a highly non-standard fashion.…
In this paper, we mainly study two notions of pattern avoidance in parking functions. First, for any collection of length 3 patterns, we compute the number of parking functions of size $n$ that avoid them under the first notion. This is…
In neuroscience, the time elapsed since the last discharge has been used to predict the probability of the next discharge. Such predictions can be improved taking into account the last two discharge times, and possibly more. Such multi-time…
Parking is an inevitable issue in the fast-growing developing countries. Increasing number of vehicles require more and more urban land to be allocated for parking. However, a little attention has been conferred to the parking issues in…
In this paper, we complete the enumeration of the number of parking functions of length $n$ avoiding, in the sense defined by Qiu and Remmel, a permutation of length 3, answering several questions of Adeniran and Pudwell. Additionally, we…
Consider a uniform rooted Cayley tree $T_{n}$ with $n$ vertices and let $m$ cars arrive sequentially, independently, and uniformly on its vertices. Each car tries to park on its arrival node, and if the spot is already occupied, it drives…