Corpus ID: 59502287

On the accuracy of the poissonisation in the infinite occupancy scheme

@article{Chebunin2017OnTA,
  title={On the accuracy of the poissonisation in the infinite occupancy scheme},
  author={M. Chebunin},
  journal={arXiv: Probability},
  year={2017}
}
We obtain asymptotic accuracy of the poissonisation in the infinite occupancy scheme. All results are obtained for integer-valued random variables having a regularly varying distribution. 
1 Citations
On nested infinite occupancy scheme in random environment
We consider an infinite balls-in-boxes occupancy scheme with boxes organised in nested hierarchy, and random probabilities of boxes defined in terms of iterated fragmentation of a unit mass. WeExpand

References

SHOWING 1-10 OF 10 REFERENCES
Univariate approximations in the infinite occupancy scheme
The paper concerns the classical occupancy scheme with infinitely many boxes. We establish approximations to the distributions of the number of occupied boxes, and of the number of boxes containingExpand
Small counts in the infinite occupancy scheme
The paper is concerned with the classical occupancy scheme in which balls are thrown independently into infinitely many boxes, with given probability of hitting each of the boxes. We establishExpand
LOCAL LIMIT THEOREMS FOR FINITE AND INFINITE URN MODELS
Local limit theorems are derived for the number of occupied urns in general finite and infinite urn models under the minimum condition that the variance tends to infinity. Our results represent anExpand
Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws ∗
This paper collects facts about the number of occupied boxes in the classical balls-in-boxes occupancy scheme with infinitely many positive frequencies: equivalently, about the number of speciesExpand
Concentration inequalities in the infinite urn scheme for occupancy counts and the missing mass, with applications
An infinite urn scheme is defined by a probability mass function $(p_j)_{j\geq 1}$ over positive integers. A random allocation consists of a sample of $N$ independent drawings according to thisExpand
Functional central limit theorems for certain statistics in an infinite urn scheme
We investigate a specific infinite urn scheme first considered by Karlin (1967). We prove functional central limit theorems for the total number of urns with at least k balls for different k.
Kolmogorov Type Law of the Logarithm for Arrays
In this paper, we establish the analogue of Kolmogorov-type law of the logarithm for an array of independent random variables. The main methods are to develop the classic Bernstein’s and Kolmogorov’sExpand
Estimation of parameters of probabilistic models which is based on the number of different elements in a sample
  • Regular variation
  • 2014
Central Limit Theorems for Infinite Urn Models
One - parameter probabilistic models of text statistics
  • Bull . Aust . Math . Soc .