On the accuracy of the poissonisation in the infinite occupancy scheme

DOI10.33048/semi.2021.18.079zbMath1475.60018arXiv1712.03487OpenAlexW3212335329MaRDI QIDQ2234434

Mikhaĭl Georgievich Chebunin

Publication date: 19 October 2021

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic upper boundsinfinite urn/cell schemepoissonisation

Mathematics Subject Classification ID

Combinatorial probability (60C05) Functional limit theorems; invariance principles (60F17)

Cites Work

• Unnamed Item
• Unnamed Item
• Kolmogorov type law of the logarithm for arrays
• Functional central limit theorems for certain statistics in an infinite urn scheme
• Concentration inequalities in the infinite urn scheme for occupancy counts and the missing mass, with applications
• Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws
• Small counts in the infinite occupancy scheme
• Central limit theorems for infinite urn models
• A statistical test for the Zipf's law by deviations from the Heaps' law
• Asymptotically normal estimators for Zipf's law
• An analogue of Kolmogorov's law of the iterated logarithm for arrays

This page was built for publication: On the accuracy of the poissonisation in the infinite occupancy scheme