Cluster Dynamics for Randomly Frustrated Systems with Finite Connectivity

Abstract

In simulations of some infinite range spin glass systems with finite connectivity, it is found that for any resonable computational time, the saturatedenergy per spin that is achieved by a cluster algorithm is lowered in comparison to that achieved by Metropolis dynamics.The gap between the average energies obtained from these two dynamics is robust with respect to variations of the annealing schedule. For some probability distribution of the interactions the ground state energy is calculated analytically within the replica symmetry assumptionand is found to be saturated by a cluster algorithm.

Revtex, 4 pages with 3 figures

Cited by in corpus (4)

• Critical behavior of the three-dimensional bond-diluted Ising spin glass: Finite-size scaling functions and Universality
• HIV time hierarchy: Winning the war while, loosing all the battles
• Ground states of two-dimensional $\pm$J Edwards-Anderson spin glasses
• Entropic Effects in the Very Low Temperature Regime of Diluted Ising Spin Glasses with Discrete Couplings