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

Alan M. Ferrenberg, D. P. Landau, and Y. Joanna Wong
Phys. Rev. Lett. 69, 3382 – Published 7 December 1992
PDFExport Citation

Abstract

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.

  • Received 29 July 1992

DOI:https://doi.org/10.1103/PhysRevLett.69.3382

©1992 American Physical Society

Authors & Affiliations

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

References (Subscription Required)

Click to Expand
Issue

Vol. 69, Iss. 23 — 7 December 1992

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×