Alexander Gnedin ; Alexander Iksanov ; Alexander Marynych
-
The Bernoulli sieve: an overview
dmtcs:2770 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2010,
DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
-
https://doi.org/10.46298/dmtcs.2770
The Bernoulli sieve: an overview
Authors: Alexander Gnedin 1; Alexander Iksanov 2; Alexander Marynych 2
NULL##NULL##NULL
Alexander Gnedin;Alexander Iksanov;Alexander Marynych
1 Mathematical Institute
2 Faculty of Cybernetics [Kyiv]
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.
Volume: DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
Source : ScholeXplorer
IsRelatedTo DOI 10.37236/1302
10.37236/1302
10.37236/1302
Analysis of an Asymmetric Leader Election Algorithm
10 Documents citing this article
Source : OpenCitations
Alsmeyer, Gerold; Iksanov, Alexander; Meiners, Matthias, 2013, Power And Exponential Moments Of The Number Of Visits And Related Quantities For Perturbed Random Walks, Journal Of Theoretical Probability, 28, 1, pp. 1-40, 10.1007/s10959-012-0475-7.
Buraczewski, Dariusz; Dovgay, Bohdan; Iksanov, Alexander, 2020, On Intermediate Levels Of Nested Occupancy Scheme In Random Environment Generated By Stick-Breaking I, Electronic Journal Of Probability, 25, none, 10.1214/20-ejp534.
Gnedin, Alexander; Iksanov, Alexander, 2012, Regenerative Compositions In The Case Of Slow Variation: A Renewal Theory Approach, Electronic Journal Of Probability, 17, none, 10.1214/ejp.v17-2002.
Gnedin, Alexander; Iksanov, Alexander, 2020, On Nested Infinite Occupancy Scheme In Random Environment, Probability Theory And Related Fields, 177, 3-4, pp. 855-890, 10.1007/s00440-020-00963-0.
Gnedin, Alexander; Iksanov, Alexander; Marynych, Alexander, 2012, A Generalization Of The Erdős–Turán Law For The Order Of Random Permutation, Combinatorics, Probability And Computing, 21, 5, pp. 715-733, 10.1017/s0963548312000247.
Iksanov, Alexander, 2016, Application To The Bernoulli Sieve, Probability And Its Applications, pp. 191-208, 10.1007/978-3-319-49113-4_5.
Iksanov, Alexander; Mallein, Bastien, 0000-0002-9435-420, 2021, Late Levels Of Nested Occupancy Scheme In Random Environment, Stochastic Models, 38, 1, pp. 130-166, 10.1080/15326349.2021.1984948.
Pitman, Jim; Tang, Wenpin, 2019, Regenerative Random Permutations Of Integers, The Annals Of Probability, 47, 3, 10.1214/18-aop1286.
Slater, Noa; Louzoun, Yoram; Gragert, Loren; Maiers, Martin; Chatterjee, Snigdhansu; Albrecht, Mark, 2015, Power Laws For Heavy-Tailed Distributions: Modeling Allele And Haplotype Diversity For The National Marrow Donor Program, PLOS Computational Biology, 11, 4, pp. e1004204, 10.1371/journal.pcbi.1004204.
Yamato, Hajime, 2020, Statistics Related With Ewens Sampling Formula, Statistics Based On Dirichlet Processes And Related Topics, pp. 49-72, 10.1007/978-981-15-6975-3_4.