Limit laws for a class of diminishing urn models.

Abstract : In this work we analyze a class of diminishing 2×2 Pólya-Eggenberger urn models with ball replacement matrix M given by $M= \binom{ -a \,0}{c -d}, a,d∈\mathbb{N}$ and $c∈\mathbb{N} _0$. We obtain limit laws for this class of 2×2 urns by giving estimates for the moments of the considered random variables. As a special instance we obtain limit laws for the pills problem, proposed by Knuth and McCarthy, which corresponds to the special case $a=c=d=1$. Furthermore, we also obtain limit laws for the well known sampling without replacement urn, $a=d=1$ and $c=0$, and corresponding generalizations, $a,d∈\mathbb{N}$ and $c=0$.
Type de document :
Communication dans un congrès
Jacquet, Philippe. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), pp.377-388, 2007, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01184767
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 17 août 2015 - 16:58:42
Dernière modification le : jeudi 11 mai 2017 - 01:02:51
Document(s) archivé(s) le : mercredi 18 novembre 2015 - 12:14:29

Fichier

dmAH0126.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184767, version 1

Collections

Citation

Markus Kuba, Alois Panholzer. Limit laws for a class of diminishing urn models.. Jacquet, Philippe. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), pp.377-388, 2007, DMTCS Proceedings. 〈hal-01184767〉

Partager

Métriques

Consultations de la notice

63

Téléchargements de fichiers

155