Critical points of the random cluster model with Newman-Ziff sampling

Abstract

We present a method for computing transition points of the random cluster model using a generalization of the Newman-Ziff algorithm, a celebrated technique in numerical percolation, to the random cluster model. The new method is straightforward to implement and works for real cluster weight $q>0$. Furthermore, results for an arbitrary number of values of $q$ can be found at once within a single simulation. Because the algorithm used to sweep through bond configurations is identical to that of Newman and Ziff, which was conceived for percolation, the method loses accuracy for large lattices when $q>1$. However, by sampling the critical polynomial, accurate estimates of critical points in two dimensions can be found using relatively small lattice sizes, which we demonstrate here by computing critical points for non-integer values of $q$ on the square lattice, to compare with the exact solution, and on the unsolved non-planar square matching lattice. The latter results would be much more difficult to obtain using other techniques.

arXiv comment10 pages

References in corpus (18)

• A fast Monte Carlo algorithm for site or bond percolation
• Efficient Monte Carlo algorithm and high-precision results for percolation
• Critical Percolation in Finite Geometries
• Invaded cluster algorithm for Potts models
• Solution of the Complex Action Problem in the Potts Model for Dense QCD
• Percolation and the pandemic
• Critical surfaces for general bond percolation problems
• Simulation of Potts models with real q and no critical slowing down
• Transfer matrix computation of critical polynomials for two-dimensional Potts models
• Critical polynomials in the nonplanar and continuum percolation models
• Bond percolation thresholds on Archimedean lattices from critical polynomial roots
• Dynamic critical behavior of the Chayes-Machta-Swendsen-Wang algorithm
• Percolation in Finite Matching Lattices
• Equivalent-neighbor percolation models in two dimensions: crossover between mean-field and short-range behavior
• The percolation critical polynomial as a graph invariant
• Efficient simulation of the random-cluster model
• Jamming and percolation of $k^3$-mers on simple cubic lattices
• Binary tree summation Monte Carlo simulation for Potts models