Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1909.02719 · Physical Review Letters

Loop-Cluster Coupling and Algorithm for Classical Statistical Models

Lei Zhang, Manon Michel, Eren Metin Elçi, Youjin Deng

Published Nov 12, 2020• 14 citations
arXivHTMLPDF

Abstract

Potts spin systems play a fundamental role in statistical mechanics and quantum field theory and can be studied within the spin, the Fortuin-Kasteleyn (FK) bond or the q-flow (loop) representation. We introduce a Loop-Cluster (LC) joint model of bond-occupation variables interacting with q-flow variables and formulate an LC algorithm that is found to be in the same dynamical universality as the celebrated Swendsen-Wang algorithm. This leads to a theoretical unification for all the representations, and numerically, one can apply the most efficient algorithm in one representation and measure physical quantities in others. Moreover, by using the LC scheme, we construct a hierarchy of geometric objects that contain as special cases the q-flow clusters and the backbone of FK clusters, the exact values of whose fractal dimensions in two dimensions remain as an open question. Our work not only provides a unified framework and an efficient algorithm for the Potts model but also brings new insights into the rich geometric structures of the FK clusters.

DOI
10.1103/physrevlett.125.200603

Related papers

Backbone three-point correlation function in the two-dimensional Potts model

Ming Li, Youjin Deng, Jesper Lykke Jacobsen +1 more

We study the three-point correlation function of the backbone in the two-dimensional Q-state Potts model using the Fortuin-Kasteleyn (FK) representation. The backbone is defined as the biconnected skeleton of an FK cluster after removing all dangling ends and bridges. To circumvent the severe critical slowing down in direct Potts simulations for large Q, we employ large-scale Monte Carlo simulations of the O(n) loop model on the hexagonal lattice, which is regarded to correspond to the Potts model with Q=n^{2}. Using a highly efficient cluster algorithm, we compute the universal three-point amplitude ratios for the backbone (R_{BB}) and FK clusters (R_{FK}). Our computed R_{FK} exhibits excellent agreement with exact conformal field theory predictions, validating the reliability of our numerical approach. In the critical regime, we find that R_{BB} is systematically larger than R_{FK}. Conversely, along the tricritical branch, R_{BB} and R_{FK} coincide within numerical accuracy, strongly suggesting that R_{BB}=R_{FK} holds throughout this regime. This finding mirrors the known equality of the backbone and FK cluster fractal dimensions at tricriticality, jointly indicating that both structures share the same geometric universality.

arXiv:2511.10393•Physical review. E•Feb 12, 2026•0 citations

Virtual bond percolation for Ising cluster dynamics

Richard C. Brower, Pablo Tamayo

The Fortuin-Kasteleyn mapping between the Ising model and the site-bond correlated percolation model is shown to be only one of an infinite class of exact mappings. These new cluster representations are a result of "renormalized" percolation rules correlated to entire blocks of spins. For example these rules allow for percolation on "virtual" bonds between spins not present in the underlying Hamiltonian. As a consequence we can define new random cluster theories each with its own Monte Carlo cluster dynamics that exactly reproduce the Ising model. By tuning parameters on the critical percolation surface, it is demonstrated numerically that cluster algorithms can be formulated for the 2-d and 3-d Ising model that have smaller autocorrelations than the original Swendsen-Wang algorithm.

arXiv:hep-lat/9206007•Physica A Statistical Mechanics and its Applications•Apr 1, 1993•9 citations

Cluster algorithm for Potts models with fixed spin densities

R. P. Bikker, G. T. Barkema

A cluster algorithm is presented for the simulation of the q-state Potts models in which the number of spins is conserved in each state. The algorithm constructs Fortuin-Kasteleyn cluster configurations from spin configurations, in a way identical to the Swendsen-Wang algorithm; the spin assignment to these clusters is, however, different, and conserves the number of spins for each state. Compared to traditional nonlocal spin-exchange algorithms, the cluster algorithm presented here suffers less from critical slowing down, and consequently is more efficient near the critical temperature.

arXiv:cond-mat/0005076•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Oct 1, 2000•3 citations

Efficient simulation of the random-cluster model

Eren Metin Elçi, Martin Weigel

The simulation of spin models close to critical 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 have 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 implementation. However, it has been recently shown that it is indeed more efficient in reducing critical slowing down than the more well-known algorithm due to Swendsen and Wang. Here, we present an efficient implementation of Sweeny's approach for the random-cluster model using recent algorithmic advances in dynamic connectivity algorithms.

arXiv:1307.6647•Physical Review E•Sep 16, 2013•17 citations

Geometric properties of the complete-graph Ising model in the loop representation

Zhiyi Li, Zongzheng Zhou, Sheng Fang +1 more

The exact solution of the Ising model on the complete graph (CG) provides an important, though mean-field, insight for the theory of continuous phase transitions. Besides the original spin, the Ising model can be formulated in the Fortuin-Kasteleyn random cluster and the loop representation, in which many geometric quantities have no correspondence in the spin representations. Using a lifted-worm irreversible algorithm, we study the CG-Ising model in the loop representation and, based on theoretical and numerical analyses, obtain a number of exact results including volume fractal dimensions and scaling forms. Moreover, by combining with the loop-cluster algorithm, we demonstrate how the loop representation can provide an intuitive understanding to the recently observed rich geometric phenomena in the random-cluster representation, including the emergence of two configuration sectors, two length scales, and two scaling windows.

arXiv:2302.14381•Physical review. E•Aug 15, 2023•4 citations

On the CFT describing the spin clusters in 2 d Potts model

Marco Picco, Raoul Santachiara

Abstract We have considered clusters of like spins in the Q -Potts model, the spin Potts clusters (S clusters). Using Monte Carlo simulations, we studied these clusters on a square lattice with periodic boundary conditions for values of Q ∈ [1, 4]. We continue the work initiated by Delfino et al (2013 J. Stat. Mech. P11011) by measuring the universal finite size corrections of the two-point connectivity. The numerical data are perfectly compatible with the conformal field theory (CFT) prediction, thus supporting the existence of a consistent CFT, still unknown, describing the connectivity Potts spin clusters. We provided in particular new insights on the energy field of such theory. For Q = 2, we found a good agreement with the prediction that the Ising spin clusters behave as the Fortuin–Kasteleyn ones at the tri-critical point of the dilute one-Potts model. We show that the structure constants are likely to be given by the imaginary Liouville structure constants, consistently with the results by Delfino et al (2013 J. Stat. Mech. P11011); Ang and Sun (2021 arXiv:2107.01788). For Q ≠ 2 instead, the structure constants we measure do not correspond to any known bootstrap solutions. The validity of our analysis is backed up by the measures of the spin Potts cluster wrapping probability for Q = 3. We evaluate the main critical exponents and the correction to the scaling. A new exact and compact expression for the torus one-point of the Q -Potts energy field is also given.

arXiv:2111.03846•Journal of Statistical Mechanics Theory and Experiment•Feb 1, 2022•6 citations
Potts spin systems play a fundamental role in statistical mechanics and quantum field theory and can be studied within the spin, the Fortuin-Kasteleyn (FK) bond or the q-flow (loop) representation. We introduce a Loop-Cluster (LC) joint model of bond-occupation variables interacting with q-flow variables and formulate an LC algorithm that is found to be in the same dynamical universality as the celebrated Swendsen-Wang algorithm. This leads to a theoretical unification for all the representations, and numerically, one can apply the most efficient algorithm in one representation and measure physical quantities in others. Moreover, by using the LC scheme, we construct a hierarchy of geometric objects that contain as special cases the q-flow clusters and the backbone of FK clusters, the exact values of whose fractal dimensions in two dimensions remain as an open question. Our work not only provides a unified framework and an efficient algorithm for the Potts model but also brings new insights into the rich geometric structures of the FK clusters.
We study the three-point correlation function of the backbone in the two-dimensional Q-state Potts model using the Fortuin-Kasteleyn (FK) representation. The backbone is defined as the biconnected skeleton of an FK cluster after removing all dangling ends and bridges. To circumvent the severe critical slowing down in direct Potts simulations for large Q, we employ large-scale Monte Carlo simulations of the O(n) loop model on the hexagonal lattice, which is regarded to correspond to the Potts model with Q=n^{2}. Using a highly efficient cluster algorithm, we compute the universal three-point amplitude ratios for the backbone (R_{BB}) and FK clusters (R_{FK}). Our computed R_{FK} exhibits excellent agreement with exact conformal field theory predictions, validating the reliability of our numerical approach. In the critical regime, we find that R_{BB} is systematically larger than R_{FK}. Conversely, along the tricritical branch, R_{BB} and R_{FK} coincide within numerical accuracy, strongly suggesting that R_{BB}=R_{FK} holds throughout this regime. This finding mirrors the known equality of the backbone and FK cluster fractal dimensions at tricriticality, jointly indicating that both structures share the same geometric universality.
The Fortuin-Kasteleyn mapping between the Ising model and the site-bond correlated percolation model is shown to be only one of an infinite class of exact mappings. These new cluster representations are a result of "renormalized" percolation rules correlated to entire blocks of spins. For example these rules allow for percolation on "virtual" bonds between spins not present in the underlying Hamiltonian. As a consequence we can define new random cluster theories each with its own Monte Carlo cluster dynamics that exactly reproduce the Ising model. By tuning parameters on the critical percolation surface, it is demonstrated numerically that cluster algorithms can be formulated for the 2-d and 3-d Ising model that have smaller autocorrelations than the original Swendsen-Wang algorithm.
A cluster algorithm is presented for the simulation of the q-state Potts models in which the number of spins is conserved in each state. The algorithm constructs Fortuin-Kasteleyn cluster configurations from spin configurations, in a way identical to the Swendsen-Wang algorithm; the spin assignment to these clusters is, however, different, and conserves the number of spins for each state. Compared to traditional nonlocal spin-exchange algorithms, the cluster algorithm presented here suffers less from critical slowing down, and consequently is more efficient near the critical temperature.
The simulation of spin models close to critical 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 have 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 implementation. However, it has been recently shown that it is indeed more efficient in reducing critical slowing down than the more well-known algorithm due to Swendsen and Wang. Here, we present an efficient implementation of Sweeny's approach for the random-cluster model using recent algorithmic advances in dynamic connectivity algorithms.
The exact solution of the Ising model on the complete graph (CG) provides an important, though mean-field, insight for the theory of continuous phase transitions. Besides the original spin, the Ising model can be formulated in the Fortuin-Kasteleyn random cluster and the loop representation, in which many geometric quantities have no correspondence in the spin representations. Using a lifted-worm irreversible algorithm, we study the CG-Ising model in the loop representation and, based on theoretical and numerical analyses, obtain a number of exact results including volume fractal dimensions and scaling forms. Moreover, by combining with the loop-cluster algorithm, we demonstrate how the loop representation can provide an intuitive understanding to the recently observed rich geometric phenomena in the random-cluster representation, including the emergence of two configuration sectors, two length scales, and two scaling windows.
Abstract We have considered clusters of like spins in the Q -Potts model, the spin Potts clusters (S clusters). Using Monte Carlo simulations, we studied these clusters on a square lattice with periodic boundary conditions for values of Q ∈ [1, 4]. We continue the work initiated by Delfino et al (2013 J. Stat. Mech. P11011) by measuring the universal finite size corrections of the two-point connectivity. The numerical data are perfectly compatible with the conformal field theory (CFT) prediction, thus supporting the existence of a consistent CFT, still unknown, describing the connectivity Potts spin clusters. We provided in particular new insights on the energy field of such theory. For Q = 2, we found a good agreement with the prediction that the Ising spin clusters behave as the Fortuin–Kasteleyn ones at the tri-critical point of the dilute one-Potts model. We show that the structure constants are likely to be given by the imaginary Liouville structure constants, consistently with the results by Delfino et al (2013 J. Stat. Mech. P11011); Ang and Sun (2021 arXiv:2107.01788). For Q ≠ 2 instead, the structure constants we measure do not correspond to any known bootstrap solutions. The validity of our analysis is backed up by the measures of the spin Potts cluster wrapping probability for Q = 3. We evaluate the main critical exponents and the correction to the scaling. A new exact and compact expression for the torus one-point of the Q -Potts energy field is also given.