A Rapid Dynamical Monte Carlo Algorithm for Glassy Systems

Werner Krauth^{∗} and Olivier Pluchery^{∗∗}

∗ CNRS-Laboratoire de Physique Statistique de l’ENS

24, rue Lhomond; F-75231 Paris Cedex 05; France e-mail: krauth@physique.ens.fr ∗∗ Ecole Normale Supérieure de Cachan 61, av. du Président Wilson; F-94235 Cachan Cedex; France

In this paper

we present a dynamical Monte Carlo algorithm which is applicable to systems satisfying a clustering condition: during the dynamical evolution the system is mostly trapped in deep local minima (as happens in glasses, pinning problems etc.). We compare the algorithm to the usual Monte Carlo algorithm, using as an example the Bernasconi model. In this model, a straightforward implementation of the algorithm gives an improvement of several orders of magnitude in computational speed with respect to a recent, already very efficient, implementation of the algorithm of Bortz, Kalos and Lebowitz.

PACS numbers: 02.70Lq 64.70Pf 64.650Cn

Typeset Using REVTEX