Related papers: The Potts and random-cluster models
The percolation of Potts spins with equal values in Potts model on graphs (networks) is considered. The general method for finding the Potts clusters size distributions is developed. It allows for full description of percolation transition…
In this chapter we review some examples, methods, and recent results involving comparison of clustering properties of point processes. Our approach is founded on some basic observations allowing us to consider void probabilities and moment…
We present a clustering method and provide a theoretical analysis and an explanation to a phenomenon encountered in the applied statistical literature since the 1990's. This phenomenon is the natural adaptability of the order when using a…
An explicit coupling construction of random-cluster measures is presented. As one of the applications of the construction, the Potts model on amenable Cayley graphs is shown to exhibit at every temperature the mixing property known as…
We note that it is possible to construct a bond vertex model that displays q-state Potts criticality on an ensemble of phi3 random graphs of arbitrary topology, which we denote as ``thin'' random graphs in contrast to the fat graphs of the…
In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of closely related graph polynomials. We explore some of the Tutte polynomial's many properties and applications and we use the Tutte polynomial to…
We give a general multiplication-convolution identity for the multivariate and bivariate rank generating polynomial of a matroid. The bivariate rank generating polynomial is transformable to and from the Tutte polynomial by simple algebraic…
The invaded cluster algorithm, a new method for simulating phase transitions, is described in detail. Theoretical, albeit nonrigorous, justification of the method is presented and the algorithm is applied to Potts models in two and three…
In the Ising and Potts model, random cluster representations provide a geometric interpretation to spin correlations. We discuss similar constructions for the Villain and XY models, where spins take values in the circle, as well as…
We give a short non-technical introduction to the Ising model, and review some successes as well as challenges which have emerged from its study in probability and mathematical physics. This includes the infinite-volume theory of phase…
We present a self consistent method based on cluster algorithms and Renormalization Group on the lattice to study critical systems numerically. We illustrate it by means of the 2D Ising model. We compute the critical exponents $\nu$ and…
Short-term earthquake clustering is one of the most important features of seismicity. Clusters are identified using various techniques, generally deterministic and based on spatio-temporal windowing. Conversely, the leading rail in…
We study the two-dimensional Potts model on the square lattice in the presence of quenched random-bond impurities. For q>4 the first-order transitions of the pure model are softened due to the impurities, and we determine the resulting…
A new class of planar tessellations, named T-tessellations, was introduced in ([10]). A model was proposed to be considered as a completely random T-tessellation model (CRTT) and its Gibbsian variants were discussed. A general simulation…
We survey a number of models from physics, statistical mechanics, probability theory and combinatorics, which are each described in terms of an orthogonal polynomial ensemble. The most prominent example is apparently the Hermite ensemble,…
After generalizing the concept of clusters to incorporate clusters that are linked to other clusters through some relatively narrow bridges, an approach for detecting patches of separation between these clusters is developed based on an…
A generalization of Tutte polynomial involved in the evaluation of the moments of the integrated geometric Brownian in the Ito formalism is discussed. The new combinatorial invariant depends on the order in which the sequence of…
We discuss a new approach to data clustering. We find that maximum likelyhood leads naturally to an Hamiltonian of Potts variables which depends on the correlation matrix and whose low temperature behavior describes the correlation…
This is a survey on the exact complexity of computing the Tutte polynomial. It is the longer 2017 version of Chapter 25 of the CRC Handbook on the Tutte polynomial and related topics, edited by J. Ellis-Monaghan and I. Moffatt, which is due…
The influence of uncorrelated, quenched disorder on the phase transition of two dimensional Potts models will be reviewed. After an introduction where the conditions of relevance of quenched randomness on phase transitions are exemplified…