A bag holds twelve labeled tokens, five blue and seven white, and three tokens are drawn without putting any back. After a blue draw fewer blue tokens remain, so the chance of blue on the next draw goes down, and after a white draw it goes up. The draws are dependent, so the binomial model, which needs independent trials, does not describe this sample exactly. This lesson counts samples directly to get the exact distribution of the number of blue tokens, finds which counts are possible, and measures how the dependence between draws changes the variance.
Key terms
Sampling without replacement
Definition A finite population is a set of distinct items, where is a positive integer. Here of the items are marked and are unmarked, with . A sample of size , where , is drawn uniformly without replacement if it consists of distinct items and each of the subsets of size has the same probability . Drawing one item at a time, each time uniformly among the items still present, produces such a sample. Sampling with replacement instead returns each item before the next draw, so an item can be drawn more than once. When every draw is uniform over all items whatever the earlier draws were, the draws are independent.
In plain words Each item can be chosen at most once, and no group of items is favored over another. Labeling items that look alike keeps them distinct, so the equally likely samples can be counted with combinations.
Example For the twelve labeled tokens and a sample of three, there are equally likely subsets, each with probability . Drawing tokens , and in any of the six possible orders gives the same subset, so samples are counted with combinations, not with ordered lists.
Hypergeometric distribution
Definition Let be the number of marked items in a uniform sample of size drawn without replacement from a population of items, of them marked. For every integer in the support of ,
because a sample with exactly marked items is a choice of of the marked items together with of the unmarked items, and all samples are equally likely. We say that has the hypergeometric distribution with parameters , and . With the convention for an integer or , the same formula gives at every integer outside the support.
In plain words Count the samples with the right mix of marked and unmarked items and divide by the number of all samples. Two binomial coefficients are multiplied because each choice from the marked group can be paired with each choice from the unmarked group.
Example For three tokens from the bag, exactly two blue tokens means two of the five blue and one of the seven white, so there are favorable subsets and . The whole distribution, written over the common denominator , is below.
The masses add to .
Support of a hypergeometric count
Definition The support of a hypergeometric count with parameters , and is the set of integers with
The upper bound holds because the sample has only items and the population has only marked ones. The lower bound holds because a count is never negative and only unmarked items exist, so a sample larger than must contain at least marked items. Every integer between the bounds has positive probability.
In plain words Before computing anything, check which counts are possible. A large sample from a population with few unmarked items is forced to contain marked ones, and the count can never exceed the number of marked items available.
Example For three tokens from the bag, the bounds are and , so all four counts to are possible. Now draw nine tokens. Only seven are white, so at least must be blue, and at most can be, so the support is . For instance,
A binomial model with and would give positive probability to the impossible counts and , and also to through , more blue tokens than the bag holds. If all twelve tokens are drawn, the support is the single value .
Dependent draws
Definition Draw the sample one item at a time, each time uniformly among the items remaining, and for let if draw is marked and otherwise. Then . By symmetry for every position , and when , for two different positions ,
When this differs from , so for the indicators of different draws are dependent. When or every indicator is constant. Linearity of expectation does not need independence, and it gives
In plain words Each draw on its own is marked with probability equal to the population proportion . What changes from draw to draw is the conditional probability. A marked draw leaves fewer marked items for later draws, and an unmarked draw leaves the same number of marked items among fewer items, yet the expected count is the same as with replacement.
Example In the token bag the first draw is blue with probability . Given that it is blue, the second draw is blue with probability , and given that it is white, with probability . Unconditionally the second draw is blue with probability . The color order blue, blue, white has probability , and the orders blue, white, blue and white, blue, blue have the same probability, so , in agreement with the count of subsets. The mean is . Three independent trials with success probability would describe drawing with replacement, not this sample.
Finite population correction
Definition For a hypergeometric count with and ,
The factor is the finite population correction, and is the variance of the count that sampling with replacement would give. The formula follows from the indicators. Since , expanding gives single terms and cross terms, so
and subtracting and simplifying gives the formula. When the count is constant, so its variance is and no correction is needed.
In plain words When and , the dependence between draws makes the count less variable than with replacement, because drawing a marked item makes later marked draws less likely and so tends to balance the sample. The correction equals when and when , since a sample of the whole population gives for certain. When the sample is a small fraction of a large population the factor is close to , and a binomial model may approximate well. The hypergeometric model is still the exact one, and how good the approximation is depends on the numbers and on the event asked about.
Example For three tokens from the twelve, and
With replacement the variance would be , and the ratio of the two is the correction .
Check yourself
- A box holds nine labeled items, three of them marked. Two items are drawn uniformly without replacement. Find the probability of exactly one marked item and the probability of at least one.
Show the answer
There are equally likely samples. Exactly one marked item means one of the three marked and one of the six unmarked, so there are favorable samples and . No marked item happens in samples, so
- In the same setting, find and , and compare the variance with the one for two draws with replacement.
Show the answer
With , , and , the mean is . The correction is , so
With replacement the count would be with variance , which is larger. As a check, the distribution is , and , which gives the same mean and .
- Now seven of the nine items are drawn without replacement. Someone uses the binomial model and reports that no marked item appears with probability . Find the support and the correct distribution of the number of marked items.
Show the answer
Only six unmarked items exist, so a sample of seven contains at least marked item, and at most . The support is and the probability of no marked item is . With samples,
The masses add to . The binomial model describes drawing with replacement, where the same item can be drawn more than once, so it gives positive probability to counts that cannot occur here, as well as through .