The Bernoulli sieve: an overview - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2010

The Bernoulli sieve: an overview

Résumé

The Bernoulli sieve is a version of the classical balls-in-boxes occupancy scheme, in which random frequencies of infinitely many boxes are produced by a multiplicative random walk, also known as the residual allocation model or stick-breaking. We give an overview of the limit theorems concerning the number of boxes occupied by some balls out of the first $n$ balls thrown, and present some new results concerning the number of empty boxes within the occupancy range.
Fichier principal
Vignette du fichier
dmAM0123.pdf (298.39 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01185568 , version 1 (20-08-2015)

Identifiants

Citer

Alexander Gnedin, Alexander Iksanov, Alexander Marynych. The Bernoulli sieve: an overview. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.329-342, ⟨10.46298/dmtcs.2770⟩. ⟨hal-01185568⟩

Collections

TDS-MACS
124 Consultations
651 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More