pith. sign in

arxiv: 1001.4920 · v1 · submitted 2010-01-27 · 🧮 math.PR

Limit theorems for the number of occupied boxes in the Bernoulli sieve

classification 🧮 math.PR
keywords boxesbernoullinumberoccupiedrandomrenewalsieveallocation
0
0 comments X
read the original 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 renewal process, also known as the residual allocation model or stick-breaking. We focus on the number $K_n$ of boxes occupied by at least one of $n$ balls, as $n\to\infty$. A variety of limiting distributions for $K_n$ is derived from the properties of associated perturbed random walks. Refining the approach based on the standard renewal theory we remove a moment constraint to cover the cases left open in previous studies.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.