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

Random number generation: A combinatorial approach

โœ Scribed by Pablo M Salzberg

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
524 KB
Volume
54
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Given a sample with replacement from a finite set ~, we show simply how to generate a maximal sequence of functions of the sample, all uniform on ~/, such that these functions are pairwise independent. We also consider the problem of generating a sequence of k-wise independent functions of the sample. To this end we set up a geometrical framework in which this problem is intimately related to that of finding, in a projective geometry of dimension r, a set of points such that no one subset with k points belongs to a hyperplane of dimension k -1.

๐Ÿ“œ SIMILAR VOLUMES

A random-number generator
A random-number generator
โœ T.A. Brody ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 554 KB
Random-number generators
Random-number generators
โœ Alan B. Forsythe ๐Ÿ“‚ Article ๐Ÿ“… 1968 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 217 KB

A commonly used uniform random-number generator is examined in light of a genetic-simulation problem. Although this generator is often useful, it proves defective in this case. The author suggests that any proposed generator be checked for the properties needed by the simulation problem at hand.