SearcharxivSearch

arXiv · 2112.13695

Mathematics of Parking: Varying Parking Rate

Abstract

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 generalization of this problem in which the unit intervals are placed with an exponential distribution with rate parameter $\lambda$. We show that the mathematical expectation of the number of intervals present at saturation satisfies a certain integral equation. Using Laplace transforms and Tauberian theorems, we investigate the asymptotic behavior of this function and describe a way to compute the corresponding limits for large $\lambda$. Then, we derive another integral equation for the derivative of this function and use it to compute the above limits for small $\lambda$ with the help of some asymptotic results for integral equations. We also show that the corresponding limits converge to the uniform case as $\lambda$ vanishes, yielding the well-known Renyi constant. Finally, we reveal the asymptotic behavior of the variance of the intervals at saturation.

Explore related subjects

Keep this discovery

BibTeXRIS

Pavel B. Dubovski, Michael Tamarov. 2021-12-27. Mathematics of Parking: Varying Parking Rate. https://doi.org/10.1007/s10955-020-02678-x

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR