Monkey tests for random number generators (Q1311978): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: George Marsaglia / rank
 
Normal rank
Property / author
 
Property / author: Arif Zaman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANDOM NUMBERS FALL MAINLY IN THE PLANES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiple prime random number generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices and the structure of random number sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of random number generators / rank
 
Normal rank

Latest revision as of 11:30, 22 May 2024

scientific article
Language Label Description Also known as
English
Monkey tests for random number generators
scientific article

    Statements

    Monkey tests for random number generators (English)
    0 references
    15 May 1994
    0 references
    This paper describes some simple but sophisticated tests of suitability of certain random number generators (RNG's). The generators are used to provide the random keystrokes. The overlapping \(m\)-tuples of successive elements in random sequences are used for assessing both uniformity and independence in the output of a random number generator. One is CAT test: RNG has a typewriter with 26 upper-case letters and how many keystrokes needed to spell CAT is tested. The others are OPSO (Overlapping-Pairs-Sparse-Occupancy), OTSO (Overlapping-Triples-Sparse- Occupancy), OQSO (Overlapping-Quadruples-Sparse-Occupancy) and DNA tests: how many missing \(k\)-letter words in a long string of \(n\) random keystrokes from an alphabet of \(\alpha\) letters are tested. Examples of RNG's in classes of congruential generators, shift register generators, lagged Fibonacci generators, add-with-carry and subtract-and- carry generators and combination generators, passing these tests are presented.
    0 references
    Overlapping-Pairs-Sparse-Occupancy
    0 references
    Overlapping-Triples-Sparse-Occupancy
    0 references
    Overlapping-Quadruples-Sparse-Occupancy
    0 references
    random number generators
    0 references
    congruential generators
    0 references
    shift register generators
    0 references
    lagged Fibonacci generators
    0 references
    monkey tests
    0 references
    sparse-occupancy tests
    0 references
    0 references
    0 references

    Identifiers