• Media type: E-Article
  • Title: The Bernoulli sieve: an overview
  • Contributor: Gnedin, Alexander; Iksanov, Alexander; Marynych, Alexander
  • Published: Centre pour la Communication Scientifique Directe (CCSD), 2010
  • Published in: Discrete Mathematics & Theoretical Computer Science, DMTCS Proceedings vol. AM,... (2010) Proceedings
  • Language: English
  • DOI: 10.46298/dmtcs.2770
  • ISSN: 1365-8050
  • Keywords: Discrete Mathematics and Combinatorics ; General Computer Science ; Theoretical Computer Science
  • Origination:
  • Footnote:
  • Description: <jats:p xml:lang="en">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.</jats:p>