Abstract
In applications of statistical techniques as well as in Monte Carlo studies it is often necessary to take a random sample from a given finite set. A common form of random sampling is simple random sampling without replacement, in which a sample of n items is selected from a population N in such a way that every subset of size n from the universe of N items has an equal chance of being the sample chosen. This is equivalent to a selection mechanism in which n different items are selected, each with equal probability, n/N, and without regard to which other items are selected.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gentle, J.E. (1998). Generation of Random Samples and Permutations. In: Random Number Generation and Monte Carlo Methods. Statistics and Computing. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2960-3_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2960-3_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-2962-7
Online ISBN: 978-1-4757-2960-3
eBook Packages: Springer Book Archive