A Rapid Dynamical Monte Carlo Algorithm for Glassy Systems

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.

RevTex 7 pages + 4 figures (uuencoded) appended; LPS preprint

References in corpus (1)

• Logarithmically slow domain growth in nonrandomly frustrated systems: Ising models with competing interactions

Cited by in corpus (13)

• Computer Simulations of Supercooled Liquids and Glasses
• Prediction and statistics of pseudoknots in RNA structures using exactly clustered stochastic simulations
• Metal-insulator transition in the one-dimensional SU(N) Hubbard model
• Creep dynamics of elastic manifolds via exact transition pathways
• Cluster-Exact Approximation of Spin Glass Groundstates
• Eigenvalue method to compute the largest relaxation time of disordered systems
• Aging without disorder on long time scales
• Closure of the Monte Carlo dynamical equations in the spherical Sherrington-Kirkpatrick model
• Non equilibrium dynamics of disordered systems : understanding the broad continuum of relevant time scales via a strong-disorder RG in configuration space
• Dynamical Behaviour of Low Autocorrelation Models
• Non-equilibrium dynamics of finite-dimensional disordered systems : RG flow towards an "infinite disorder" fixed point at large times
• Specific heat of the Coulomb glass
• Dynamical barriers for the random ferromagnetic Ising model on the Cayley tree : traveling-wave solution of the real space renormalization flow