Standard

Asymptotic Normality in the Problem of Selfish Parking. / Ananjevskii, S. M. ; Kryukov, N. A. .

In: Vestnik St. Petersburg University: Mathematics, Vol. 52, No. 4, 2019, p. 368-379.

Research output: Contribution to journalArticlepeer-review

Harvard

Ananjevskii, SM & Kryukov, NA 2019, 'Asymptotic Normality in the Problem of Selfish Parking', Vestnik St. Petersburg University: Mathematics, vol. 52, no. 4, pp. 368-379.

APA

Ananjevskii, S. M., & Kryukov, N. A. (2019). Asymptotic Normality in the Problem of Selfish Parking. Vestnik St. Petersburg University: Mathematics, 52(4), 368-379.

Vancouver

Ananjevskii SM, Kryukov NA. Asymptotic Normality in the Problem of Selfish Parking. Vestnik St. Petersburg University: Mathematics. 2019;52(4):368-379.

Author

Ananjevskii, S. M. ; Kryukov, N. A. . / Asymptotic Normality in the Problem of Selfish Parking. In: Vestnik St. Petersburg University: Mathematics. 2019 ; Vol. 52, No. 4. pp. 368-379.

BibTeX

@article{3f2e1a0f523a4bca956fa828f45fc51d,
title = "Asymptotic Normality in the Problem of Selfish Parking",
abstract = "We continue in this paper to study one of the models of a discrete analog of the Renyi problem, also known as the parking problem. Suppose that n and i are integers satisfying n ≥ 0 and 0 ≤ i ≤ n – 1. We place an open interval (i, i + 1) in the segment [0, n] with i being a random variable taking values 0, 1, 2, …, n – 1 with equal probability for all n ≥ 2. If n < 2, then we say that the interval does not fit. After placing the first interval, two free segments [0, i] and [i + 1, n] are formed and independently filled with intervals of unit length according to the same rule, and so on. At the end of the process of filling the segment [0, n] with intervals of unit length, the distance between any two adjacent unit intervals does not exceed one. Suppose now that Xn is the number of unit intervals placed. In our earlier work published in 2018, we studied the asymptotic behavior of the first moments of random variable Xn. In contrast to the classical case, the exact expressions for the expectation, variance, and third central moment were obtained. The asymptotic behavior of all central moments of random variable Xn is investigated in this paper and the asymptotic normality for Xn is proved.",
keywords = "random filling, discrete parking problem, asymptotic behavior of moments and asymptotic normality",
author = "Ananjevskii, {S. M.} and Kryukov, {N. A.}",
note = "Ananjevskii, S.M. & Kryukov, N.A. Vestnik St.Petersb. Univ.Math. (2019) 52: 368. https://doi.org/10.1134/S1063454119040022",
year = "2019",
language = "English",
volume = "52",
pages = "368--379",
journal = "Vestnik St. Petersburg University: Mathematics",
issn = "1063-4541",
publisher = "Pleiades Publishing",
number = "4",

}

RIS

TY - JOUR

T1 - Asymptotic Normality in the Problem of Selfish Parking

AU - Ananjevskii, S. M.

AU - Kryukov, N. A.

N1 - Ananjevskii, S.M. & Kryukov, N.A. Vestnik St.Petersb. Univ.Math. (2019) 52: 368. https://doi.org/10.1134/S1063454119040022

PY - 2019

Y1 - 2019

N2 - We continue in this paper to study one of the models of a discrete analog of the Renyi problem, also known as the parking problem. Suppose that n and i are integers satisfying n ≥ 0 and 0 ≤ i ≤ n – 1. We place an open interval (i, i + 1) in the segment [0, n] with i being a random variable taking values 0, 1, 2, …, n – 1 with equal probability for all n ≥ 2. If n < 2, then we say that the interval does not fit. After placing the first interval, two free segments [0, i] and [i + 1, n] are formed and independently filled with intervals of unit length according to the same rule, and so on. At the end of the process of filling the segment [0, n] with intervals of unit length, the distance between any two adjacent unit intervals does not exceed one. Suppose now that Xn is the number of unit intervals placed. In our earlier work published in 2018, we studied the asymptotic behavior of the first moments of random variable Xn. In contrast to the classical case, the exact expressions for the expectation, variance, and third central moment were obtained. The asymptotic behavior of all central moments of random variable Xn is investigated in this paper and the asymptotic normality for Xn is proved.

AB - We continue in this paper to study one of the models of a discrete analog of the Renyi problem, also known as the parking problem. Suppose that n and i are integers satisfying n ≥ 0 and 0 ≤ i ≤ n – 1. We place an open interval (i, i + 1) in the segment [0, n] with i being a random variable taking values 0, 1, 2, …, n – 1 with equal probability for all n ≥ 2. If n < 2, then we say that the interval does not fit. After placing the first interval, two free segments [0, i] and [i + 1, n] are formed and independently filled with intervals of unit length according to the same rule, and so on. At the end of the process of filling the segment [0, n] with intervals of unit length, the distance between any two adjacent unit intervals does not exceed one. Suppose now that Xn is the number of unit intervals placed. In our earlier work published in 2018, we studied the asymptotic behavior of the first moments of random variable Xn. In contrast to the classical case, the exact expressions for the expectation, variance, and third central moment were obtained. The asymptotic behavior of all central moments of random variable Xn is investigated in this paper and the asymptotic normality for Xn is proved.

KW - random filling

KW - discrete parking problem

KW - asymptotic behavior of moments and asymptotic normality

UR - https://link.springer.com/article/10.1134/S1063454119040022

M3 - Article

VL - 52

SP - 368

EP - 379

JO - Vestnik St. Petersburg University: Mathematics

JF - Vestnik St. Petersburg University: Mathematics

SN - 1063-4541

IS - 4

ER -

ID: 50796376