Random number generation from chaotic impact collisions

The collision sequence produced by N-beads sliding on a frictionless hoop gives rise to a dynamical system that can be formulated as a string of matrix products [4, 5]. The matrices that form the product are written in the order in which the collisions unfold and their corresponding eigenvalues on the unit circle are treated as a non-autonomous rotation map on $S^1 $. The problem of three beads of masses $m$, $m - \epsilon $, $m + \epsilon $ is studied computationally for splitting parameter values $ \epsilon \geqslant 0$. When $ \epsilon = 0$ (three equal masses), the spectrum is discrete on the unit circle underlying the fact that the dynamics are regular [5]. For $ \epsilon > 0$, the eigenvalue spectrum produced by a deterministically chaotic trajectory is compared to spectra produced by two different stochastic problems. The first is the spectrum associated with the sequence of matrix products in which a random number algorithm is used to produce the matrix orderings. The second is the spectrum generated from a random walk process on the unit circle. We describe how to use the chaotic collision sequences as the basis for a random number generating algorithm and we conclude, by an examination of both the runs and reverse arrangement tests, that the degree of randomness produced by these sequences is equivalent to Matlab's rand() routine for generating random numbers.