Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Limit laws for a cla ...
Conference paper

Limit laws for a class of diminishing urn models.

Markus Kuba (1), Alois Panholzer (1)
(1) Institut für Diskrete Mathematik und Geometrie [Wien]
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2006
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)
Proceedings
DOI
10.46298/dmtcs.3519
License
https://about.hal.science/hal-authorisation-v1
Indicators
584
Views
629
Downloads

Limit laws for a class of diminishing urn models.

Markus Kuba (1), Alois Panholzer (1)
(1) Institut für Diskrete Mathematik und Geometrie [Wien]
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$.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • Pólya urns
  • diminishing urns
  • pills problem
  • sampling without replacement
Cited by

Source: OpenCitations

  • Analysis of Statistics for Generalized Stirling Permutations

    Combinatorics Probability Computing

    Authors : MARKUS KUBA ORCID, ALOIS PANHOLZER ORCID

    Journal reference : Volume 20, 2011, pp. 875-910

    DOI : 10.1017/s0963548311000381
  • On the area under lattice paths associated with triangular diminishing urn models

    Advances in Applied Mathematics

    Authors : Markus Kuba ORCID, Alois Panholzer ORCID

    Journal reference : Volume 44, 2009, pp. 329-358

    DOI : 10.1016/j.aam.2009.09.001
Preview
Loading PDF preview...