Geodesic
The Bernoulli sieve: an overview
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2010_special_258_a6,
     author = {Gnedin, Alexander and Iksanov, Alexander and Marynych, Alexander},
     title = {The {Bernoulli} sieve: an overview},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)},
     year = {2010},
     doi = {10.46298/dmtcs.2770},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2770/}
}
TY  - JOUR
AU  - Gnedin, Alexander
AU  - Iksanov, Alexander
AU  - Marynych, Alexander
TI  - The Bernoulli sieve: an overview
JO  - Discrete mathematics & theoretical computer science
PY  - 2010
VL  - DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2770/
DO  - 10.46298/dmtcs.2770
LA  - en
ID  - DMTCS_2010_special_258_a6
ER  - 
%0 Journal Article
%A Gnedin, Alexander
%A Iksanov, Alexander
%A Marynych, Alexander
%T The Bernoulli sieve: an overview
%J Discrete mathematics & theoretical computer science
%D 2010
%V DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2770/
%R 10.46298/dmtcs.2770
%G en
%F DMTCS_2010_special_258_a6
Gnedin, Alexander; Iksanov, Alexander; Marynych, Alexander. The Bernoulli sieve: an overview. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010). doi : 10.46298/dmtcs.2770. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2770/

Cité par Sources :