The Bernoulli sieve: an overview

A.V. Gnedin; A. Iksanov; O. Marynych

The Bernoulli sieve: an overview

A.V. Gnedin, A. Iksanov, O. Marynych

extern

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

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.

Original language	English
Title of host publication	DMTCS Proceedings AM
Pages	329-342
Number of pages	14
Publication status	Published - 2010

Bibliographical note

21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)

Access to Document

3302
Open Access (free)
Final published version, 298 KB

Cite this

@inproceedings{8a09ae57de864306967dc3b07283759f,

title = "The Bernoulli sieve: an overview",

abstract = "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.",

author = "A.V. Gnedin and A. Iksanov and O. Marynych",

note = "21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)",

year = "2010",

language = "English",

pages = "329--342",

booktitle = "DMTCS Proceedings AM",

}

TY - GEN

T1 - The Bernoulli sieve: an overview

AU - Gnedin, A.V.

AU - Iksanov, A.

AU - Marynych, O.

N1 - 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

M3 - Conference contribution

SP - 329

EP - 342

BT - DMTCS Proceedings AM

ER -

The Bernoulli sieve: an overview

Abstract

Bibliographical note

Access to Document

Fingerprint

Cite this