๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithms for random sampling from single-variate distributions

โœ Scribed by Francesc Salvat

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
850 KB
Volume
46
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

BASIC algorithms for random sampling and
BASIC algorithms for random sampling and treatment randomization
โœ John A. Byers ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 796 KB

Five BASIC programs to select random samples from populations or to randomize treatments are presented. Program 1 is used to obtain randomization of any number of treatments in an equal number of positions or test units for any number of replicates. Program 2 produces latin squares of any size for t

Random selection algorithms for spatial
Random selection algorithms for spatial and temporal sampling
โœ John A. Byers ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 961 KB

Seven BASIC programs are presented that use algorithms for selection of treatments and samples in spatial and temporal contexts. Program (1) takes a natural sequence of samples (such as logs cut from a tree trunk) and divides them into groups (equal to the number of samples divided by treatments), a

Random sampling from a truncated bivaria
Random sampling from a truncated bivariate normal distribution
โœ Khalaf E. Ahmad; Nagi S. Abd El-Hakim ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 171 KB

A simple and easily implemented algorithm is presented for obtaining random variables from a truncated standard normal distribution. The algorithm is based on a generalization of Von Neumann's rejection technique. The first-stage sampling in our algorithm is from the truncated logistic distribution.