Generation of Random Samples and Permutations

  • James E. Gentle
Part of the Statistics and Computing book series (SCO)


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.


Order Statistic Geographic Information System Beta Distribution Simple Random Sampling Monte Carlo Study 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • James E. Gentle
    • 1
  1. 1.Institute for Computational Sciences and InformaticsGeorge Mason UniversityFairfaxUSA

Personalised recommendations