Geodesic
The Page-Rényi parking process
Lucas Gerin1
1Ecole Polytechnique
The electronic journal of combinatorics, Tome 22 (2015) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In the Page parking (or packing) model on a discrete interval (also known as the discrete Rényi packing problem or the unfriendly seating problem), cars of length two successively park uniformly at random on pairs of adjacent places, until only isolated places remain.We use a probabilistic construction of the Page parking to give a short proof of the (known) fact that the proportion of the interval occupied by cars goes to $1-e^{-2}$, when the length of the interval goes to infinity. We also obtain some new consequences on both finite and infinite parkings.
DOI : 10.37236/5150
Classification : 60C05, 68R05
Mots-clés : discrete packing, discrete parking, random deposition, coupon collector, poissonization

Lucas Gerin  1

1 Ecole Polytechnique 
@article{10_37236_5150,
     author = {Lucas Gerin},
     title = {The {Page-R\'enyi} parking process},
     journal = {The electronic journal of combinatorics},
     year = {2015},
     volume = {22},
     number = {4},
     doi = {10.37236/5150},
     zbl = {1331.60023},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/5150/}
}
TY  - JOUR
AU  - Lucas Gerin
TI  - The Page-Rényi parking process
JO  - The electronic journal of combinatorics
PY  - 2015
VL  - 22
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/5150/
DO  - 10.37236/5150
ID  - 10_37236_5150
ER  - 
%0 Journal Article
%A Lucas Gerin
%T The Page-Rényi parking process
%J The electronic journal of combinatorics
%D 2015
%V 22
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/5150/
%R 10.37236/5150
%F 10_37236_5150
Lucas Gerin. The Page-Rényi parking process. The electronic journal of combinatorics, Tome 22 (2015) no. 4. doi: 10.37236/5150

Cité par Sources :