The number of link and cluster states: the core of the 2D q state Potts model
Abstract
Due to Fortuin and Kastelyin the q state Potts model has a representation as a sum over random graphs, generalizing the Potts model to arbitrary q is based on this representation. A key element of the Random Cluster representation is the combinatorial factor G(,), which is the number of ways to form distinct clusters, consisting of totally edges. We have devised a method to calculate G(,) from Monte Carlo simulations.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.