# On Sampling without replacement and OK-Corral urn models

@article{Kuba2010OnSW, title={On Sampling without replacement and OK-Corral urn models}, author={Markus Kuba}, journal={arXiv: Combinatorics}, year={2010} }

In this work we discuss two urn models with general weight sequences $(A,B)$ associated to them, $A=(\alpha_n)_{n\in\N}$ and $B=(\beta_m)_{m\in\N}$, generalizing two well known P\'olya-Eggenberger urn models, namely the so-called sampling without replacement urn model and the OK Corral urn model. We derive simple explicit expressions for the distribution of the number of white balls, when all black have been drawn, and obtain as a byproduct the corresponding results for the P\'olya-Eggenberger…

## 2 Citations

On death processes and urn models

- Mathematics, Computer Science
- 2011

We use death processes and embeddings into continuous time in order to analyze several urn models with a diminishing content. In particular we discuss generalizations of the pill's problem,…

On a stochastic version of Lanchester's model of combat

- Mathematics
- 2019

A discrete-time stochastic version ofanchester's model of combat, which is amenable to exact solution, is revisited with the aim of deriving key results within one setting.

## References

SHOWING 1-10 OF 27 REFERENCES

Limiting Distributions for a Class Of Diminishing Urn Models

- MathematicsAdvances in Applied Probability
- 2012

In this work we analyze a class of 2 × 2 Pólya-Eggenberger urn models with ball replacement matrix and c = pa with . We determine limiting distributions by obtaining a precise recursive description…

Lattice Paths, Sampling Without Replacement, and Limiting Distributions

- MathematicsElectron. J. Comb.
- 2009

These weighted lattice paths can be interpreted as probability distributions arising in the context of Polya-Eggenberger urn models, more precisely, the latticepaths are sample paths of the well known sampling without replacement urn.

Some exactly solvable models of urn process theory

- Mathematics
- 2006

We establish a fundamental isomorphism between discrete-time balanced urn processes and certain ordinary differential systems, which are nonlinear, autonomous, and of a simple monomial form. As a…

Asymptotic probabilities in a sequential urn scheme related to the matchbox problem

- MathematicsAdvances in Applied Probability
- 1998

Generalizing the classical Banach matchbox problem, we consider the process of removing two types of ‘items’ from a ‘pile’ with selection probabilities for the type of the next item to be removed…

Polya Urn Models and Connections to Ran- dom Trees: A Review

- Mathematics
- 2003

This paper reviews Polya urn models and their connec- tion to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought…

On Ramanujan's Q-function

- Mathematics, Computer ScienceJournal of Computational and Applied Mathematics
- 1995

Classification of large P ´ olya-Eggenberger urns with regard to their asymptotics

- Mathematics
- 2005

This article deals with Polya generalized urn models with constant balance in any dimension. It is based on the algebraic approach of Pouyanne (2005) and classifies urns having "large'' eigenvalues…

Analytic urns

- Mathematics
- 2003

This article describes a purely analytic approach to urn models of the generalized or extended Pólya–Eggenberger type, in the case of two types of balls and constant “balance,” that is, constant row…

Analytic Combinatorics of the Mabinogion Urn

- Mathematics
- 2008

The Mabinogion urn is a simple model of the spread of influences amongst versatile populations. It corresponds to a non-standard urn with balls of two colours: each time a ball is drawn, it causes a…

Advances in Urn Models during the Past Two Decades

- Mathematics
- 1997

This paper surveys some key developments that have occurred pertaining to urn models in probabilistic, statistical and biological literatures during the past two decades. It should be regarded as a…