𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Small sample uniformity in random number generation

✍ Scribed by E.A. Galperin; I. Galperin

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
781 KB
Volume
52
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis

Nonstatistical notions of uniformity suitable for small samples are proposed and studied. New algorithms are presented for generation of small samples of quasi-random points good with respect to distance, plane projection, or plane section uniformity. Examples are presented for visual evaluation of uniformity in small samples on the screen of computers. The methods can be used for generation of quasi-random lattices for nonconvex global optimization, multiple integration, and other applications.

πŸ“œ SIMILAR VOLUMES

Method for obtaining small sets of pseud
Method for obtaining small sets of pseudo random numbers with uniform distribution
✍ C.A. Rebeiro πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 196 KB

When a small set of random number is drawn from a large one, it can be seen that only a few of them can be considered uniformly distributed. In the present work, a method of selecting a small set, having a uniform distribution, from a large set is described. A least squares fit is used as a gauge fo

(De)randomized Construction of Small Sam
(De)randomized Construction of Small Sample Spaces in NC
✍ David R. Karger; Daphne Koller πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 384 KB

Koller and Megiddo introduced the paradigm of constructing compact distributions that satisfy a given set of constraints and showed how it can be used to efficiently derandomize certain types of algorithms. In this paper, we significantly extend their results in two ways. First, we show how their ap