Abstract
Bernoulli sieve is a recursive construction of a random composition (ordered partition) of integer . This composition can be induced by sampling from a random discrete distribution which has frequencies equal to the sizes of component intervals of a stick-breaking interval partition of . We exploit Markov property of the composition and its renewal representation to derive asymptotics of the moments and to prove a central limit theorem for the number of parts.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.