The Bernoulli sieve: an overview

zbMath1357.60026arXiv1005.5705MaRDI QIDQ2959915

Alexander Marynych, Aleksander M. Iksanov, Alexander V. Gnedin

Publication date: 10 February 2017

Full work available at URL: https://arxiv.org/abs/1005.5705

zbMATH Keywords

random partitionsmultiplicative random walkBernoulli sieveoccupancy problemlimit theorms

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (12)

Moment convergence of first-passage times in renewal theory ⋮ Regenerative random permutations of integers ⋮ On the number of empty boxes in the Bernoulli sieve. II. ⋮ Renewal sequences and record chains related to multiple zeta sums ⋮ Functional limit theorems for the number of occupied boxes in the Bernoulli sieve ⋮ Block size in geometric(\(p\))-biased permutations ⋮ On intermediate levels of nested occupancy scheme in random environment generated by stick-breaking I ⋮ Gaps and interleaving of point processes in sampling from a residual allocation model ⋮ On nested infinite occupancy scheme in random environment ⋮ Weak Convergence of Finite-Dimensional Distributions of the Number of Empty Boxes in the Bernoulli Sieve ⋮ Power and exponential moments of the number of visits and related quantities for perturbed random walks ⋮ Late levels of nested occupancy scheme in random environment

This page was built for publication: The Bernoulli sieve: an overview