Related papers: The Potts and random-cluster models
The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By…
In recent years, a better understanding of the Monte Carlo method has provided us with many new techniques in different areas of statistical physics. Of particular interest are so called cluster methods, which exploit the considerable…
In this note we study some of the properties of the generating polynomial for homomorphisms from a graph to at complete weighted graph on $q$ vertices. We discuss how this polynomial relates to a long list of other well known graph…
We present exact calculations of Potts model partition functions and the equivalent Tutte polynomials for polygon chain graphs with open and cyclic boundary conditions. Special cases of the results that yield flow and reliability…
The Ising and Potts models, among the most important models in statistical physics, have been used for modeling binary and multinomial data on lattices in a wide variety of disciplines such as psychology, image analysis, biology, and…
We review the properties of six families of orthogonal polynomials that form the main bulk of the collection called the Askey--Wilson scheme of polynomials. We give connection coefficients between them as well as the so-called linearization…
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…
When modeling the distribution of a set of data by a mixture of Gaussians, there are two possibilities: i) the classical one is using a set of parameters which are the proportions, the means and the variances; ii) the second is to consider…
Through Monte Carlo simulations we study two-dimensional Potts models with $q=4, 6$ and 8 states on Voronoi-Delaunay random lattice. In this study, we assume that the coupling factor $J$ varies with the distance $r$ between the first…
We perform a Random Matrix Theory (RMT) analysis of the quantum four-state chiral Potts chain for different sizes of the chain up to size L=8. Our analysis gives clear evidence of a Gaussian Orthogonal Ensemble statistics, suggesting the…
The Tutte polynomial is a powerfull analytic tool to study the structure of planar graphs. In this paper, we establish some relations between the number of clusters per bond for planar graph and its dual : these relations bring into play…
We consider the problem of sampling from the ferromagnetic $q$-state Potts model on the random $d$-regular graph with parameter $\beta>0$. A key difficulty that arises in sampling from the model is the existence of a metastability window…
In this survey, we give a friendly introduction from a graph theory perspective to the q-state Potts model, an important statistical mechanics tool for analyzing complex systems in which nearest neighbor interactions determine the aggregate…
In the first part of this paper I shall discuss the round-about way of how the integrable chiral Potts model was discovered about 30 years ago. As there should be more higher-genus models to be discovered, this might be of interest. In the…
We prove some variants of the exponential formula and apply them to the multivariate Tutte polynomials (also known as Potts-model partition functions) of graphs. We also prove some further identities for the multivariate Tutte polynomial,…
The two-point correlation function of a Potts model on a graph $G$ may be expressed in terms of the flow polynomials of `Poissonian' random graphs derived from $G$ by replacing each edge by a Poisson-distributed number of copies of itself.…
Since their appearance in the 1950s, computational models capable of performing probabilistic choices have received wide attention and are nowadays pervasive in almost every areas of computer science. Their development was also inextricably…
A sharp-threshold theorem is proved for box-crossing probabilities on the square lattice. The models in question are the random-cluster model near the self-dual point $p_{\mathrm {sd}}(q)=\sqrt{q}/(1+\sqrt{q})$, the Ising model with…
A class of random graphs is introduced and studied. The graphs are constructed in an algorithmic way from five motifs which were found in [Milo R., Shen-Orr S., Itzkovitz S., Kashtan N., Chklovskii D., Alon U., Science, 2002, 298, 824-827].…
We derive exact relations between the Potts model partition function, or equivalently the Tutte polynomial, for a network (graph) $G$ and a network obtained from $G$ by (i) by replacing each edge (i.e., bond) of $G$ by two or more edges…