An examination of the negative occupancy distribution and the coupon-collector distribution

01/10/2022
by   Ben O'Neill, et al.
0

We examine the negative occupancy distribution and the coupon-collector distribution, both of which arise as distributions relating to hitting times in the extended occupancy problem. These distributions constitute a full solution to a generalised version of the coupon collector problem, by describing the behaviour of the number of items we need to collect to obtain a full collection or a partial collection of any size. We examine the properties of these distributions and show how they can be computed and approximated. We give some practical guidance on the feasibility of computing large blocks of values from the distributions, and when approximation is required.

READ FULL TEXT

Authors

page 13

page 16

page 18

page 19

01/10/2022

An examination of the spillage distribution

We examine a family of discrete probability distributions that describes...
03/15/2022

A negative binomial approximation in group testing

We consider the problem of group testing (pooled testing), first introdu...
06/24/2020

Discrete distributions from a Markov chain

A discrete-time stochastic process derived from a model of basketball is...
12/25/2018

On discrimination between the Lindley and xgamma distributions

For a given data set the problem of selecting either Lindley or xgamma d...
02/26/2020

Extremes of Censored and Uncensored Lifetimes in Survival Data

The i.i.d. censoring model for survival analysis assumes two independent...
12/22/2017

Modeling Spatial Overdispersion with the Generalized Waring Process

Modeling spatial overdispersion requires point processes models with fin...
11/13/2021

Transformation and simulation for a generalised queuing problem using a G/G/n/G/+ queuing model

We examine a generalised queuing model which we call the G/G/n/G/+ model...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.