A law of the iterated logarithm for the number of occupied boxes in the Bernoulli sieve

DOI10.1016/J.SPL.2017.03.017zbMATH Open1386.60107arXiv1609.09238OpenAlexW2525034532MaRDI QIDQ2405947FDOQ2405947

Authors: Alexander Iksanov, Wissem Jedidi, Fethi Bouzeffour 

Publication date: 28 September 2017

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Abstract: The Bernoulli sieve is an infinite occupancy scheme obtained by allocating the points of a uniform $[0,1]$ sample over an infinite collection of intervals made up by successive positions of a multiplicative random walk independent of the uniform sample. We prove a law of the iterated logarithm for the number of non-empty (occupied) intervals as the size of the uniform sample becomes large.

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

Recommendations

• Limit theorems for the number of occupied boxes in the Bernoulli sieve
• Weak convergence of finite-dimensional distributions of the number of empty boxes in the Bernoulli sieve
• The Bernoulli sieve: an overview
• On the number of empty boxes in the Bernoulli sieve I
• Functional limit theorems for the number of occupied boxes in the Bernoulli sieve

zbMATH Keywords

renewal theorylaw of iterated logarithmBernoulli sieveperturbed random walkinfinite occupancy

Mathematics Subject Classification ID

Strong limit theorems (60F15) Renewal theory (60K05)

Cites Work

• Title not available (Why is that?)
• Stochastic-Process Limits
• Stopped Random Walks
• Title not available (Why is that?)
• Functional limit theorems for the number of occupied boxes in the Bernoulli sieve
• The Bernoulli sieve
• Limit theorems for the number of occupied boxes in the Bernoulli sieve
• Title not available (Why is that?)

Cited In (7)

• On intermediate levels of nested occupancy scheme in random environment generated by stick-breaking I
• A law of the iterated logarithm for small counts in Karlin's occupancy scheme
• Late levels of nested occupancy scheme in random environment
• On intermediate levels of a nested occupancy scheme in a random environment generated by stick-breaking II
• On the number of empty boxes in the Bernoulli sieve I
• Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws
• On nested infinite occupancy scheme in random environment

This page was built for publication: A law of the iterated logarithm for the number of occupied boxes in the Bernoulli sieve

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2405947)