Simple random sample
Definition
Let be a finite population of units, and let . Let be a random subset, defined on a probability space. Then is a simple random sample of size from if for every subset with , Here is the binomial coefficient, the number of combinations of units out of .
Remarks
Equivalently, one draws units one after the other, each uniformly at random among the units not yet drawn. Each unit is in with probability . For values attached to the units, the sample mean is unbiased for the population mean . Its variance is , where . Sampling with replacement, where independent uniform draws are made, is a different design.
Example: and , with uniform on the pairs. Each pair has probability , as required, and unit lies in of the pairs, so it is chosen with probability .
Non-example: with , choose uniformly and take . Every unit is chosen with probability , but the pair has probability instead of . So equal inclusion probabilities are not enough for a simple random sample.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Binomial coefficient concept
- Combination concept
- Probability space concept
- Simple random sample definition
Further reading
About this page
| Tag | 6B05T6XHY0 |
|---|---|
| URI | m2://6B05T6XHY0 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 62D05 |
| Defines | Simple random sample |
| Uses | Combination, Binomial coefficient, Probability space |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.