Related papers: Sampling in Uniqueness from the Potts and Random-C…
A new algorithm is presented, which allows to calculate numerically the partition function Z_q of the d-dimensional q-state Potts models for arbitrary real values q>0 at any given temperature T with high precision. The basic idea is to…
We study the q-state Potts model on the simple cubic lattice with ferromagnetic interactions in one lattice direction, and antiferromagnetic interactions in the two other directions. As the temperature T decreases, the system undergoes a…
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…
We apply a newly proposed Monte Carlo method, the Wang-Landau algorithm, to the study of the three-dimensional antiferromagnetic q-state Potts models on a simple cubic lattice. We systematically study the phase transition of the models with…
In this paper we study a continuum version of the Potts model. Particles are points in R^d, with a spin which may take S possible values, S being at least 3. Particles with different spins repel each other via a Kac pair potential. In mean…
In a recent paper hep-lat/9704020 we investigated Potts models on ``thin'' random graphs -- generic Feynman diagrams, using the idea that such models may be expressed as the N --> 1 limit of a matrix model. The models displayed first order…
In this paper, we study the annealed ferromagnetic $q$-state Potts model on sparse rank-1 random graphs, where vertices are equipped with a vertex weight, and the probability of an edge is proportional to the product of the vertex weights.…
The critical phenomena of two-dimensional (2D) antiferromagnetic $q$-state Potts model on the square lattice with $q=2,3,4,5$ and 6 are investigated using the technique of supervised neural network (NN). Unlike the conventional NN…
The partition function of the q-state Potts model with random ferromagnetic couplings in the large-q limit is generally dominated by the contribution of a single diagram of the high temperature expansion. Computing this dominant diagram…
We investigate the non-self-averaging properties of the dynamics of Ising, 4-state Potts and 10-state Potts models in single-cluster Monte Carlo simulations on quenched ensembles of planar, trivalent Phi3 random graphs, which we use as an…
A remarkable connection has been established for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the computational complexity of approximating the partition function for graphs with maximum degree D…
Motivated by the least squares solver Blendenpik, we investigate three strategies for uniform sampling of rows from m x n matrices Q with orthonormal columns. The goal is to determine, with high probability, how many rows are required so…
Propp and Wilson's method of coupling from the past allows one to efficiently generate exact samples from attractive statistical distributions (e.g., the ferromagnetic Ising model). This method may be generalized to non-attractive…
We study the bond percolation problem in random graphs of $N$ weighted vertices, where each vertex $i$ has a prescribed weight $P_i$ and an edge can connect vertices $i$ and $j$ with rate $P_iP_j$. The problem is solved by the $q\to 1$…
The ferromagnetic Ising model is a model of a magnetic material and a central topic in statistical physics. It also plays a starring role in the algorithmic study of approximate counting: approximating the partition function of the…
We study the $q$-state Potts models on a cubic lattice in the thermodynamic limit using tensor renormalization group transformations with the triad approximation. By computing the thermodynamic potentials, we locate the first-order phase…
We apply a replica inference based Potts model method to unsupervised image segmentation on multiple scales. This approach was inspired by the statistical mechanics problem of "community detection" and its phase diagram. Specifically, the…
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 paper, we study the problem of sampling from a graphical model when the model itself is changing dynamically with time. This problem derives its interest from a variety of inference, learning, and sampling settings in machine…
Specify a randomized algorithm that, given a very large graph or network, extracts a random subgraph. What can we learn about the input graph from a single subsample? We derive laws of large numbers for the sampler output, by relating…