MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Consider a Polya urn model in which we have $N$ balls of which $k$ are black and the rest are white. We repeatedly draw balls (without replacement) in "batches" of size $m$ (assume $m$ divides $N$), and are interested in the probability that every batch contains fewer than $t$ black balls.

It is not too hard to write out an expression for the above probability. But I am looking for a closed-form expression, or at least nice upper/lower bounds on the probability in question. (Feel free to assume $N$ large if that helps.)

This seems like it should be a well studied question in reliability engineering, but I have not found any references. Can anyone help?

share|cite|improve this question
One special case was asked here: – Douglas Zare May 14 '13 at 16:52

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.