Abstract
Tossing a coin is the most elementary Monte-Carlo experiment. In a computer the coin is replaced by a pseudo random number generator. It can be shown analytically and by exact enumerations that popular random number generators are not capable of imitating a fair coin: pseudo random coins show more “heads” than “tails.” This bias explains the empirically observed failure of some random number generators in random walk experiments. It can be traced down to the special role of the value zero in the algebra of finite fields.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Paul D. Coddington, Analysis of random number generators using Monte-Carlo simulation, Int. J. Mod. Phys. C 5:547(1994).
Aaldert Compagner, Definitions of randomness, Am. J. Phys. 59:700–705 (1991).
Aaldert Compagner, The hierarchy of correlations in random binary sequences, J. Stat. Phys. 63:883–896 (1991).
Alan M. Ferrenberg, D. P. Landau, and Y. Joanna Wong, Monte-Carlo simulations: Hidden errors from “good” random number generators, Phys. Rev. Lett. 69:3382–3384 (1992).
Andreas Futschik, DeIst der Euro fair? Ergebnis einer empirischen Untersuchung, Austrian J. Statistics 31:35–40 (2002).
S. W. Golomb, Shift Register Sequences, revised edition (Aegan Park Press, Laguna Hills, CA, 1982).
Peter Grassberger, Monte-Carlo simulations of 3d self-avoiding walks, J. Phys. A: Math. Gen. 26:2769–2776 (1993).
Bert F. Green, J. E. Keith Smith, and Laura Klem, Empirical tests of an additive random number generator, J. Assoc. Computing Machinery 6:527–537 (1959).
Brian Hayes, The wheel of fortune, American Scientist 81:114–118 (1993).
Dieter Jungnickel, Finite Fields: Structure and Arithmetics Bibliographisches Institut, Mannheim, 1993).
S. Kirkpatrick and E. Stoll, A very fast shift-register sequence random number generator, J. Comput. Phys. 40:517–526 (1981).
Donald E. Knuth, The Art of Computer Programming, 3rd edition, Vol. 2 (Addisonü Wesley, 1998).
Pierre L'Ecuyer and Richard Simard, On the performance of birthday spacings tests with certain families of random number generators, Math. Comput. Simulat. 53:131–137 (2001).
D. H. Lehmer, Mathematical methods in large-scale computing units, in Proc. 2nd Symposium on Large-Scale Digital Calculating Machinery, Cambridge, MA, pp. 141–146 (1949).
George Marsaglia, Random numbers fall mainly in the planes, Proc. Nat. Acad. Sci. 61:25–28 (1968).
Stephan Mertens and Heiko Bauke, Entropy of pseudo random number generators (2003), http://arxiv.org/abs/cond-mat/0305319.
F. Schmid and N. B. Wilding, Errors in Monte-Carlo the simulations using shift register random number generators, Int. J. Mod. Phys. C 6:781–787 (1995).
I. Vattulainen, T. Ala-Nissila, and K. Kankaala, Physical tests for random numbers in simulations, Phys. Rev. Lett. 73:2513–2516 (1994).
Robert M. Ziff, Four-tap shift-register-sequence random-number generators, Comput. Phys. 12:385–392 (1998).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bauke, H., Mertens, S. Pseudo Random Coins Show More Heads Than Tails. Journal of Statistical Physics 114, 1149–1169 (2004). https://doi.org/10.1023/B:JOSS.0000012521.67853.9a
Issue Date:
DOI: https://doi.org/10.1023/B:JOSS.0000012521.67853.9a