The Bernoulli sieve

67 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws ∗ (2007, background): “θ log n), and has been also shown for some instances of random (pj) under more general assumptions of slow variation [3, 4, 21].”
Regenerative composition structures (2003, background): “See also Section 4 and [13, 14 ], for further examples of regenerative composition structures.”
Asymptotic laws for compositions derived from transformed subordinators (2004, unknown): “ar X iv :m at h/ 04 03 43 8v 3 [ m at h. PR ] 2 4 M ay 2 00 6 The Annals of Probability 2006, Vol. 34, No. 2, 468–492 DOI: 10.1214/009117905000000639 c© Institute of Mathematical Statistics, 2006”
Limit theorems for the number of occupied boxes in the Bernoulli sieve (2010, background): “The term “Bernoulli sieve” can be understood when interpreting the occupancy scheme in terms of a randomized leader-election procedure (see [7] for more details).”