Counting intervals in the packing process
Baryshnikov, Yuliy ; Gnedin, Alexander
Ann. Appl. Probab., Tome 11 (2001) no. 2, p. 863-877 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We consider a sequential interval packing process similar to Rényi ’s “car parking problem” but with a generator of random intervals which allows for arbitrarily small lengths. Embedding the process in continuous time, we view it as a self-similar interval splitting process.We determine the asymptotical behavior of the quantities such as the number of intervals packed to some instant and obtain convergence results in the context of the more general splitting model.
Publié le : 2001-08-14
Classification:  none,  none 
@article{1015345351,
     author = {Baryshnikov, Yuliy and Gnedin, Alexander},
     title = {Counting intervals in the packing process},
     journal = {Ann. Appl. Probab.},
     volume = {11},
     number = {2},
     year = {2001},
     pages = { 863-877},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1015345351}
}

Baryshnikov, Yuliy; Gnedin, Alexander. Counting intervals in the packing process. Ann. Appl. Probab., Tome 11 (2001) no. 2, pp.  863-877. http://gdmltest.u-ga.fr/item/1015345351/