Asymptotics of the overflow in urn models

DOI10.1017/jpr.2021.87zbMath1502.60031arXiv1905.06663OpenAlexW4288351206MaRDI QIDQ5868529

Pawel Hitczenko, Raúl Gouet, Jacek Wesołowski

Publication date: 21 September 2022

Published in: Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

random allocationweak limit theoremurn modeloccupancy problem

Mathematics Subject Classification ID

Martingales with discrete parameter (60G42) Central limit and other weak theorems (60F05) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Uses Software

• DLMF

Cites Work

• Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws
• Small counts in the infinite occupancy scheme
• Negative association of random variables, with applications
• Large deviation asymptotics for occupancy problems.
• Local limit theorems for finite and infinite urn models
• Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process
• Polya Urn Models
• Computing the probability of hash table/urn overflow
• Limit theorems for random sums of dependent d-dimensional random vectors
• Asymptotic Normality Through Factorial Cumulants and Partition Identities
• An inequality involving multinomial probabilities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotics of the overflow in urn models