A rapid dynamical Monte Carlo algorithm for glassy systems

DOI10.1088/0305-4470/27/18/012MaRDI QIDQ4869914zbMATH OpenOpenAlexFDO

Authors Werner Krauth, Olivier Pluchery

Publication date 17 July 1996

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/9407019

Mathematics Subject Classification ID

Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30)

Abstract: 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.

Cited in

(3)

• scientific article; zbMATH DE number 912981 (Why is no real title available?)
• Dynamical barriers for the random ferromagnetic Ising model on the Cayley tree: traveling-wave solution of the real space renormalization flow
• Prediction and statistics of pseudoknots in RNA structures using exactly clustered stochastic simulations

This page was built for publication: A rapid dynamical Monte Carlo algorithm for glassy systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4869914)