Probability-Changing Cluster Algorithm for Two-Dimensional Systems with the Vector Order Parameter

Y Tomita,Y Okabe

doi:10.1007/978-3-642-55522-0_23

Probability-Changing Cluster Algorithm for Two-Dimensional Systems with the Vector Order Parameter

Y Tomita, Y Okabe

https://doi.org/10.1007/978-3-642-55522-0_23

Copy DOI

Publication Date: Jan 1, 2003

Affiliation: Tokyo Metropolitan University

#Vector Order Parameter #Q-state Clock Models + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

The newly proposed probability-changing cluster (PCC) Monte Carlo algorithm is extended for the study of systems with the vector order parameter. We use Wolff’s idea of the embedded cluster formalism for assigning clusters. The Kosterlitz-Thouless transitions for the two-dimensional XY and q-state clock models are studied systematically by using the PCC algorithmKeywordsMonte Carlo AlgorithmLogarithmic CorrectionMonte Carlo StepClock ModelCheck ProcessThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.