Berlin 2012 – scientific programme

Parts | Days | Selection | Search | Updates | Downloads | Help

DY: Fachverband Dynamik und Statistische Physik

DY 29: Posters II

DY 29.15: Poster

Thursday, March 29, 2012, 17:00–19:00, Poster A

Efficient implementation of Sweeny’s algorithm for simulations of the Potts model — •Eren Elçi¹ and Martin Weigel^1,2 — ¹Institut für Physik, Johannes Gutenberg-Universität Mainz, Staudinger Weg 7, 55099 Mainz, Germany — ²Applied Mathematics Research Centre, Coventry University, Coventry, CV1 5FB, England

The simulation of spin models close to points of continuous phase transitions is heavily impeded by the occurrence of critical slowing down. A number of cluster algorithms usually based on the Fortuin-Kasteleyn representation of the Potts model and suitable generalizations for continuous-spin models has been used to increase simulation efficiency. The first algorithm making use of this representation, suggested by Sweeny in 1983, has not found widespread adoption due to problems in its efficient implementation. It has been shown recently, however, that it is indeed more efficient in reducing critical slowing down that the more well-known variants due to Swendsen/Wang and Wolff. Here, we discuss efficient implementations of Sweeny’s approach based on union-and-find algorithms and using recent algorithmic advances in dynamic connectivity algorithms, and show how these can be used for efficient simulations in the random-cluster model.