New results on a generalized coupon collector problem using Markov chains

Emmanuelle Anceaume 1, 2 Yann Busnel 3 Bruno Sericola 4
1 CIDER
IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
2 CIDRE - Confidentialité, Intégrité, Disponibilité et Répartition
CentraleSupélec, Inria Rennes – Bretagne Atlantique , IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
3 GDD - Gestion de Données Distribuées [Nantes]
LINA - Laboratoire d'Informatique de Nantes Atlantique
4 DIONYSOS - Dependability Interoperability and perfOrmance aNalYsiS Of networkS
Inria Rennes – Bretagne Atlantique , IRISA-D2 - RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES
Abstract : We study in this paper a generalized coupon collector problem, which consists in determining the distribution and the moments of the time needed to collect a given number of distinct coupons that are drawn from a set of coupons with an arbitrary probability distribution. We suppose that a special coupon called the null coupon can be drawn but never belongs to any collection. In this context, we obtain expressions of the distribution and the moments of this time. We also prove that the almost-uniform distribution, for which all the non-null coupons have the same drawing probability, is the distribution which minimizes the expected time to get a fixed subset of distinct coupons. This optimization result is extended to the complementary distribution of that time when the full collection is considered, proving by the way this well-known conjecture. Finally, we propose a new conjecture which expresses the fact that the almost-uniform distribution should minimize the complementary distribution of the time needed to get any fixed number of distinct coupons.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01005333
Contributor : Yann Busnel <>
Submitted on : Thursday, June 12, 2014 - 1:26:28 PM
Last modification on : Friday, November 16, 2018 - 1:39:09 AM
Long-term archiving on : Friday, September 12, 2014 - 11:15:49 AM

File

coupon.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01005333, version 1

Citation

Emmanuelle Anceaume, Yann Busnel, Bruno Sericola. New results on a generalized coupon collector problem using Markov chains. 2014. ⟨hal-01005333⟩

Share

Metrics

Record views

2287

Files downloads

288