Dynamic Critical Behavio(u)r of a Cluster Algorithm for the Ashkin--Teller Model

Physics – High Energy Physics – High Energy Physics - Lattice

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

51062 bytes uuencoded gzip'ed (expands to 111127 bytes Postscript); 4 pages including all figures; contribution to Lattice '95

Scientific paper

10.1016/0920-5632(96)00176-4

We study the dynamic critical behavior of a Swendsen--Wang--type algorithm for the Ashkin--Teller model. We find that the Li--Sokal bound on the autocorrelation time ($\tau_{{\rm int},{\cal E}} \ge {\rm const} \times C_H$) holds along the self-dual curve of the symmetric Ashkin--Teller model, but this bound is apparently not sharp. The ratio $\tau_{{\rm int},{\cal E}}/C_H$ appears to tend to infinity either as a logarithm or as a small power ($0.05 \ltapprox p \ltapprox 0.12$).

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 Behavio(u)r of a Cluster Algorithm for the Ashkin--Teller Model 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 Behavio(u)r of a Cluster Algorithm for the Ashkin--Teller Model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Critical Behavio(u)r of a Cluster Algorithm for the Ashkin--Teller Model will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-458259

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