论文信息 - Cluster dynamics for randomly frustrated systems with finite connectivity.

Cluster dynamics for randomly frustrated systems with finite connectivity.

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.

Solomon | Kanter | Persky

[1] Kandel,et al. General cluster Monte Carlo dynamics. , 1991, Physical review. B, Condensed matter.

[2] Wolff,et al. Collective Monte Carlo updating for spin systems. , 1989, Physical review letters.

[3] J. Almeida,et al. Dilute random spin systems with finite connectivity at low temperature: solution with continuous components and longitudinal stability , 1988 .

[4] M. Mézard,et al. Mean-field theory of randomly frustrated systems with finite connectivity , 1987 .

[5] Kanter,et al. Mean-field theory of spin-glasses with finite coordination number. , 1987, Physical review letters.

[6] Wang,et al. Replica Monte Carlo simulation of spin glasses. , 1986, Physical review letters.

[7] K. Binder,et al. Spin glasses: Experimental facts, theoretical concepts, and open questions , 1986 .

[8] A. Bray,et al. Phase diagrams for dilute spin glasses , 1985 .

[9] H. Sompolinsky,et al. Relaxational dynamics of the Edwards-Anderson model and the mean-field theory of spin-glasses , 1982 .

[10] Giorgio Parisi,et al. Theory and numerical simulation of computationally difficult systems , 1992 .

[11] M. Mézard,et al. Spin Glass Theory and Beyond , 1987 .