Simple Random Sampling is not that Simple

Simple Random Sampling is not that Simple

Neyman Seminar
Sep 21, 2016, 04:00 PM - 05:00 PM | 1011 Evans Hall | Happening As Scheduled
Philip Stark, Department of Statistics, UC Berkeley (Speaker)
A simple random sample (SRS) of size k from a population of size n is a sample drawn at random in such a way that every subset of k of the n items is equally likely to be selected. The theory of inference from SRSs is fundamental in Statistics; many techniques and formulae assume that the data are an SRS, including parametric and nonparametric methods, such as permutation tests. True SRSs are...