Simple Random Sampling

In statistics, a **simple random sample** is a subset of individuals (a sample) chosen from a larger set (a population). Each individual is chosen randomly and entirely by chance, such that each individual has the same probability of being chosen at any stage during the sampling process, and each subset of *k* individuals has the same probability of being chosen for the sample as any other subset of *k* individuals.^{[1]} This process and technique is known as **simple random sampling**, and should not be confused with systematic random sampling. A simple random sample is an unbiased surveying technique.

Simple random sampling is a basic type of sampling, since it can be a component of other more complex sampling methods. The principle of simple random sampling is that every object has the same probability of being chosen. For example, suppose *N* college students want to get a ticket for a basketball game, but there are only *X* < *N* tickets for them, so they decide to have a fair way to see who gets to go. Then, everybody is given a number in the range from 0 to *N*-1, and random numbers are generated, either electronically or from a table of random numbers. Numbers outside the range from 0 to *N*-1 are ignored, as are any numbers previously selected. The first *X* numbers would identify the lucky ticket winners.

In small populations and often in large ones, such sampling is typically done "**without replacement**", i.e., one deliberately avoids choosing any member of the population more than once. Although simple random sampling can be conducted with replacement instead, this is less common and would normally be described more fully as simple random sampling **with replacement**. Sampling done without replacement is no longer independent, but still satisfies exchangeability, hence many results still hold. Further, for a small sample from a large population, sampling without replacement is approximately the same as sampling with replacement, since the odds of choosing the same individual twice is low.

An unbiased random selection of individuals is important so that if a large number of samples were drawn, the average sample would accurately represent the population. However, this does not guarantee that a particular sample is a perfect representation of the population. Simple random sampling merely allows one to draw externally valid conclusions about the entire population based on the sample.

Conceptually, simple random sampling is the simplest of the probability sampling techniques. It requires a complete sampling frame, which may not be available or feasible to construct for large populations. Even if a complete frame is available, more efficient approaches may be possible if other useful information is available about the units in the population.

Advantages are that it is free of classification error, and it requires minimum advance knowledge of the population other than the frame. Its simplicity also makes it relatively easy to interpret data collected in this manner. For these reasons, simple random sampling best suits situations where not much information is available about the population and data collection can be efficiently conducted on randomly distributed items, or where the cost of sampling is small enough to make efficiency less important than simplicity. If these conditions do not hold, stratified sampling or cluster sampling may be a better choice.

Several efficient algorithms for simple random sampling have been developed.^{[2]}^{[3]} A naive algorithm is the draw-by-draw algorithm where at each step we remove the item at that step from the set with equal probability and put the item in the sample. We continue until we have sample of desired size k. The drawback of this method is that it requires random access in the set.

The selection-rejection algorithm developed by Fan et al. in 1962^{[4]} requires single pass over data; however, it is a sequential algorithm and requires knowledge of total count of items n, which is not available in streaming scenarios.

A very simple random sort algorithm was proved by Sunter in 1977^{[5]} which simply assigns a random number drawn from uniform distribution (0, 1) as key to each item, sorts all items using the key and selects the smallest k items.

J. Vitter in 1985^{[6]} proposed reservoir sampling algorithm which is often widely used. This algorithm does not require advance knowledge of n and uses constant space.

Random sampling can also be accelerated by sampling from the distribution of gaps between samples,^{[7]} and skipping over the gaps.

Consider a school with 1000 students, and suppose that a researcher wants to select 100 of them for further study. All their names might be put in a bucket and then 100 names might be pulled out. Not only does each person have an equal chance of being selected, we can also easily calculate the probability *P* of a given person being chosen, since we know the sample size (*n*) and the population (*N*):

1. In the case that any given person can only be selected once (i.e., after selection a person is removed from the selection pool):

2. In the case that any selected person is returned to the selection pool (i.e., can be picked more than once):

This means that every student in the school has in any case approximately a 1 in 10 chance of being selected using this method. Further, all combinations of 100 students have the same probability of selection.

If a systematic pattern is introduced into random sampling, it is referred to as "systematic (random) sampling". An example would be if the students in the school had numbers attached to their names ranging from 0001 to 1000, and we chose a random starting point, e.g. 0533, and then picked every 10th name thereafter to give us our sample of 100 (starting over with 0003 after reaching 0993). In this sense, this technique is similar to cluster sampling, since the choice of the first unit will determine the remainder. This is no longer simple random sampling, because some combinations of 100 students have a larger selection probability than others - for instance, {3, 13, 23, ..., 993} has a 1/10 chance of selection, while {1, 2, 3, ..., 100} cannot be selected under this method.

If the members of the population come in three kinds, say "blue" "red" and "black", the number of red elements in a sample of given size will vary by sample and hence is a random variable whose distribution can be studied. That distribution depends on the numbers of red and black elements in the full population. For a simple random sample *with* replacement, the distribution is a *binomial distribution*. For a simple random sample *without* replacement, one obtains a *hypergeometric distribution*.

**^**Yates, Daniel S.; David S. Moore; Daren S. Starnes (2008).*The Practice of Statistics, 3rd Ed*. Freeman. ISBN 978-0-7167-7309-2.**^***Sampling Algorithms - Springer*. 2006-01-01. ISBN 978-0-387-30814-2. doi:10.1007/0-387-34240-0.**^**Meng, Xiangrui (2013). "Scalable Simple Random Sampling and Stratified Sampling" (PDF).*Proceedings of the 30th International Conference on Machine Learning (ICML-13)*: 531-539.**^**Fan, C. T.; Muller, Mervin E.; Rezucha, Ivan (1962-06-01). "Development of Sampling Plans by Using Sequential (Item by Item) Selection Techniques and Digital Computers".*Journal of the American Statistical Association*.**57**(298): 387-402. ISSN 0162-1459. doi:10.1080/01621459.1962.10480667.**^**Sunter, A. B. (1977-01-01). "List Sequential Sampling with Equal or Unequal Probabilities without Replacement".*Applied Statistics*.**26**(3). JSTOR 10.2307/2346966. doi:10.2307/2346966.**^**Vitter, Jeffrey S. (1985-03-01). "Random Sampling with a Reservoir".*ACM Trans. Math. Softw*.**11**(1): 37-57. ISSN 0098-3500. doi:10.1145/3147.3165.**^**Erlandson, Erik J. (2014-09-11). "Faster Random Samples With Gap Sampling".

This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.

Featured Thought Leaders