pith. machine review for the scientific record. sign in

arxiv: cond-mat/9512035 · v1 · submitted 1995-12-06 · ❄️ cond-mat

Recognition: unknown

Exchange Monte Carlo Method and Application to Spin Glass Simulations

Authors on Pith no claims yet
classification ❄️ cond-mat
keywords timeexchangemethodprocesssystemtemperaturesalgorithmcarlo
0
0 comments X
read the original abstract

We propose an efficient Monte Carlo algorithm for simulating a ``hardly-relaxing" system, in which many replicas with different temperatures are simultaneously simulated and a virtual process exchanging configurations of these replica is introduced. This exchange process is expected to let the system at low temperatures escape from a local minimum. By using this algorithm the three-dimensional $\pm J$ Ising spin glass model is studied. The ergodicity time in this method is found much smaller than that of the multi-canonical method. In particular the time correlation function almost follows an exponential decay whose relaxation time is comparable to the ergodicity time at low temperatures. It suggests that the system relaxes very rapidly through the exchange process even in the low temperature phase.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Monte Carlo Study of the Dipolar Universality Class in Three Dimensions

    hep-th 2026-05 unverdicted novelty 7.0

    Monte Carlo simulations on lattices up to 48 cubed produce estimates of critical exponents for the 3D dipolar universality class, confirm a continuous phase transition, and show restoration of rotation invariance.

  2. Scalable Determination of Penalization Weights for Constrained Optimizations on Approximate Solvers

    quant-ph 2026-04 unverdicted novelty 7.0

    A pre-computation method sets penalization weights for constrained QUBO problems with provable guarantees for Gibbs solvers and polynomial scaling for many problem classes.