Limit theorems for a class of random outer measures in infinite urn schemes
Berhane Abebe, Mikhail Chebunin, Artyom Kovalevskii

TL;DR
This paper establishes a functional central limit theorem for a class of random outer measures derived from infinite urn schemes, with applications to probabilistic text models.
Contribution
It introduces a new limit theorem for the statistics of urns in infinite schemes, extending understanding of their asymptotic behavior.
Findings
Proves a functional central limit theorem for sets of finite unions of intervals.
Shows the outer measure properties of urn occupancy counts.
Applies results to probabilistic models of text data.
Abstract
An urn scheme is a probabilistic model in which balls are placed into urns sequentially and independently of each other. All balls share the same probability distribution for hitting the urns. In the simplest case, there is a finite number of urns and the probabilities of hitting each urn are equal. In an infinite urn scheme, there is a countable number of urns, and the hitting probabilities form a probability mass function on the set of urn labels, so they depend on the urn number. The statistics of interest is the number of urns with at least k balls after throwing n balls. Thus, we assume that there is a countable family of urns, and we fix the probabilities for a ball to hit each urn (the same for all balls). For an arbitrary subset A of the unit interval [0, 1], we do not consider all ball indices from 1 to n, but only those that belong to the set nA, and we study the number of…
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
TopicsMathematical Dynamics and Fractals · Random Matrices and Applications · Stochastic processes and statistical mechanics
