corner
corner

Phys. Rev. Lett. 69, 3382–3384 (1992)

Monte Carlo simulations: Hidden errors from ‘‘good’’ random number generators

Download: PDF (155 kB) Buy this article Export: BibTeX or EndNote (RIS)

Alan M. Ferrenberg and D. P. Landau
Center for Simulational Physics, The University of Georgia, Athens, Georgia 30602

Y. Joanna Wong
IBM Corporation, Supercomputing Systems, Kingston, New York 12401

Received 29 July 1992; published in the issue dated 7 December 1992

The Wolff algorithm is now accepted as the best cluster-flipping Monte Carlo algorithm for beating ‘‘critical slowing down.’’ We show how this method can yield incorrect answers due to subtle correlations in ‘‘high quality’’ random number generators.

© 1992 The American Physical Society

URL:
http://link.aps.org/doi/10.1103/PhysRevLett.69.3382
DOI:
10.1103/PhysRevLett.69.3382
PACS:
75.40.Mg, 05.70.Jk, 64.60.Fr