A Priori Tests for the MIXMAX Random Number Generator
Spyros Konitopoulos, Konstantin G. Savvidy

TL;DR
This paper introduces a priori tests for the MIXMAX pseudo-random number generator, analyzing correlation properties and lattice structure, and finds that MIXMAX exhibits ideal correlation behavior and a stable spectral index, indicating high-quality randomness.
Contribution
The paper develops new a priori tests for linear matrix-recursion generators and demonstrates that MIXMAX has vanishing serial correlations and a robust lattice structure.
Findings
Serial correlation vanishes for MIXMAX.
Lowest non-zero correlator at lag s=1 involves four elements.
Spectral index of MIXMAX is independent of matrix size and equals √3.
Abstract
We define two a priori tests of pseudo-random number generators for the class of linear matrix-recursions. The first desirable property of a random number generator is the smallness of serial or lagged correlations between generated numbers. For the particular matrix generator called MIXMAX, we find that the serial correlation actually vanishes. Next, we define a more sophisticated measure of correlation, which is a multiple correlator between elements of the generated vectors. The lowest order non-vanishing correlator is a four-element correlator and is non-zero for lag . At lag , this correlator again vanishes. For lag , the lowest non-zero correlator is a six-element correlator. The second desirable property for a linear generator is the favorable structure of the lattice which typically appears in dimensions higher than the dimension of the phase space of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Chaos-based Image/Signal Encryption · Algorithms and Data Compression
