On intermediate levels of nested occupancy scheme in random environment generated by stick-breaking: the case of heavy tails
Oksana Braganets, Alexander Iksanov

TL;DR
This paper studies a nested occupancy scheme in a random environment with heavy-tailed distributions, analyzing the asymptotic behavior of the number of occupied boxes at intermediate levels using advanced probabilistic techniques.
Contribution
It extends previous work by analyzing the scheme under heavy-tailed conditions where the mean of | extlog W| is infinite, revealing new limit behaviors for intermediate levels.
Findings
Weak convergence of normalized occupied boxes process to a Lebesgue-Stieltjes integral
Identification of inverse stable subordinator as the limiting process
Extension of previous models to heavy-tailed distributions
Abstract
We investigate a nested balls-in-boxes scheme in a random environment. The boxes follow a nested hierarchy, with infinitely many boxes in each level, and the hitting probabilities of boxes are random and obtained by iterated fragmentation of a unit mass. The hitting probabilities of the first-level boxes are given by a stick-breaking model for , where , are independent copies of a random variable taking values in . The infinite balls-in-boxes scheme in the first level is known as a Bernoulli sieve. We assume that the mean of is infinite and the distribution tail of is regularly varying at . Denote by the number of occupied boxes in the th level provided that there are balls and call the level intermediate, if and $j_n =…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstruction Project Management and Performance · Probabilistic and Robust Engineering Design · Forecasting Techniques and Applications
