RUS  ENG
Full version
JOURNALS // Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy // Archive

Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy, 2020 Volume 7, Issue 4, Pages 662–677 (Mi vspua154)

This article is cited in 2 papers

MATHEMATICS

Discretization of the parking problem

N. A. Kryukov

St. Petersburg State University, 7-9, Universitetskaya nab., St. Petersburg, 199034, Russian Federation

Abstract: The present work consider a natural discretization of Rényi's so-called "parking problem". Let $l$, $n$, $i$ be integers satisfying $l\geqslant 2$, $n \geqslant 0$ and $0 \leqslant i \leqslant n - l$. We place an open interval $(i,i + l)$ in the segment $[0, n]$ with $i$ being a random variable taking values $0, 1, 2, \ldots, n-l$ with equal probability for all $n \geqslant l$. If $n < l$ we say that the interval does not fit. After placing the first interval two free segments $[0, i]$ and $[i + l, n]$ are formed and independently filled with the intervals of length l according to the same rule, etc. At the end of the filling process the distance between any two adjacent unit intervals is at most $l-1$. Let $\xi_n,l$ denote the cumulative length of the intervals placed. The asymptotics behavior of expectations of the aforementioned random sequence have already been studied. This contribution has an aim to continue this investigation and establish the behavior of variances of the same sequence.

Keywords: random filling, discrete "parking" problem, asymptotic behavior of moments.

UDC: 519.2

MSC: 60F99

Received: 20.02.2020
Revised: 11.05.2020
Accepted: 18.07.2020

DOI: 10.21638/spbu01.2020.408



© Steklov Math. Inst. of RAS, 2026