Dynamic Critical Behavior of the Chayes-Machta Algorithm for the Random-Cluster Model. I. Two Dimensions

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

LaTeX2e, 75 pages including 26 Postscript figures

Scientific paper

We study, via Monte Carlo simulation, the dynamic critical behavior of the Chayes-Machta dynamics for the Fortuin-Kasteleyn random-cluster model, which generalizes the Swendsen-Wang dynamics for the q-state Potts ferromagnet to non-integer q \ge 1. We consider spatial dimension d=2 and 1.25 \le q \le 4 in steps of 0.25, on lattices up to 1024^2, and obtain estimates for the dynamic critical exponent z_{CM}. We present evidence that when 1 \le q \lesssim 1.95 the Ossola-Sokal conjecture z_{CM} \ge \beta/\nu is violated, though we also present plausible fits compatible with this conjecture. We show that the Li-Sokal bound z_{CM} \ge \alpha/\nu is close to being sharp over the entire range 1 \le q \le 4, but is probably non-sharp by a power. As a byproduct of our work, we also obtain evidence concerning the corrections to scaling in static observables.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Dynamic Critical Behavior of the Chayes-Machta Algorithm for the Random-Cluster Model. I. Two Dimensions 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 Dynamic Critical Behavior of the Chayes-Machta Algorithm for the Random-Cluster Model. I. Two Dimensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Critical Behavior of the Chayes-Machta Algorithm for the Random-Cluster Model. I. Two Dimensions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-427793

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.