Cluster Dynamics for Randomly Frustrated Systems with Finite Connectivity

Details Cluster Dynamics for Randomly Frustrated Systems with Finite Connectivity Cluster Dynamics for Randomly Frustrated Systems with Finite Connectivity

1996-04-17

arxiv.org/abs/cond-mat/9604112v1

Phys. Rev. E 53 1212 (1996)

Physics

Condensed Matter

Revtex, 4 pages with 3 figures

Scientific paper

10.1103/PhysRevE.53.1212

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.

Affiliated with

Also associated with

No associations

Rating

Cluster Dynamics for Randomly Frustrated Systems with Finite Connectivity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cluster Dynamics for Randomly Frustrated Systems with Finite Connectivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cluster Dynamics for Randomly Frustrated Systems with Finite Connectivity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-600203