CLUSTER DYNAMICS FOR RANDOMLY FRUSTRATED SYSTEMS WITH FINITE CONNECTIVITY

Authors
PERSKY N KANTER I SOLOMON S
Citation
N. Persky et al., CLUSTER DYNAMICS FOR RANDOMLY FRUSTRATED SYSTEMS WITH FINITE CONNECTIVITY, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics, 53(1), 1996, pp. 1212-1216
Citations number
15
Categorie Soggetti
Physycs, Mathematical","Phsycs, Fluid & Plasmas
Journal title
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics → ACNP
ISSN journal
1063651X
Volume
53
Issue
1
Year of publication
1996
Part
B
Pages
1212 - 1216
Database
ISI
SICI code
1063-651X(1996)53:1<1212:CDFRFS>2.0.ZU;2-7
Abstract
In simulations of some infinite-range spin-glass systems with finite c onnectivity, it is found that for any resonable computational time, th e saturated energy per spin that is achieved by a cluster algorithm is lowered in comparison to that achieved by Metropolis dynamics. The ga p between the average energies obtained from these two dynamics is rob ust with respect to variations of the annealing schedule. For some pro bability distribution of the interactions the ground state energy is c alculated analytically within the replica symmetry assumption and is f ound to be saturated by a cluster algorithm.