The Page-Rényi parking process - Centre de mathématiques appliquées (CMAP) Accéder directement au contenu
Article Dans Une Revue The Electronic Journal of Combinatorics Année : 2015

The Page-Rényi parking process

Résumé

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 give a probabilistic proof of the (known) fact that the proportion of the interval covered by cars goes to 1-exp(-2) , when the length of the interval goes to infinity. We obtain some new consequences, and also study a version of this process defined on the infinite line.
Fichier principal
Vignette du fichier
Parking_VersionFinale.pdf (285.61 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01088818 , version 1 (28-11-2014)
hal-01088818 , version 2 (05-12-2014)
hal-01088818 , version 3 (19-10-2015)

Identifiants

Citer

Lucas Gerin. The Page-Rényi parking process. The Electronic Journal of Combinatorics, 2015, 22 (4), pp.P.4.4. ⟨hal-01088818v3⟩
447 Consultations
475 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More