Related papers: Complexity of Ising Polynomials
We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced…
We study partition functions and thermodynamic limits for the Ising model on three families of finite graphs converging to infinite self-similar graphs. They are provided by three well-known groups realized as automorphism groups of regular…
We consider tiling rectangles of size 4m x 4n by T-shaped tetrominoes. Each tile is assigned a weight that depends on its orientation and position on the lattice. For a particular choice of the weights, the generating function of tilings is…
In this present paper, the recurrence equations of an Ising model with three coupling constants on a third-order Cayley tree are obtained. Paramagnetic and ferromagnetic phases associated with the Ising model are characterized. Types of…
We have proposed an efficient algorithm to calculate physical quantities in the translational invariant three-dimensional tensor networks, which is particularly relevant to the study of the three-dimensional classical statistical models and…
Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…
In a seminal paper (Weitz, 2006), Weitz gave a deterministic fully polynomial approximation scheme for count- ing exponentially weighted independent sets (equivalently, approximating the partition function of the hard-core model from…
Recent inapproximability results of Sly (2010), together with an approximation algorithm presented by Weitz (2006) establish a beautiful picture for the computational complexity of approximating the partition function of the hard-core…
Normal factor graph duality offers new possibilities for Monte Carlo algorithms in graphical models. Specifically, we consider the problem of estimating the partition function of the ferromagnetic Ising and Potts models by Monte Carlo…
A scheme for measuring complex temperature partition functions of Ising models is introduced. In the context of ordered qubit registers this scheme finds a natural translation in terms of global operations, and single particle measurements…
A cluster weight Ising model is proposed by introducing an additional cluster weight in the partition function of the traditional Ising model. It is equivalent to the O($n$) loop model or $n$-component face cubic loop model on the…
Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and…
We present an implementation of the method of orthogonal polynomials which is particularly suitable to study the partition functions of Penner random matrix models, to obtain their explicit forms in the exactly solvable cases, and to…
We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the…
This work is concerned with the theory of Graphical Representation for the Ising and Potts Models over general lattices with non-translation invariant external field. We explicitly describe in terms of the Random Cluster Representation the…
As a problem in data science the inverse Ising (or Potts) problem is to infer the parameters of a Gibbs-Boltzmann distributions of an Ising (or Potts) model from samples drawn from that distribution. The algorithmic and computational…
This paper presents an alternative proof of the connection between the partition function of the Ising model on a finite graph $G$ and the set of non-backtracking walks on $G$. The techniques used also give formulas for spin-spin…
Taking (2+1)-dimensional pure Einstein gravity for arbitrary genus $g$ as a model, we investigate the relation between the partition function formally defined on the entire phase space and the one written in terms of the reduced phase…
The partition function of the two-dimensional Ising model with zero magnetic field on a square lattice with m x n sites wrapped on a torus is computed within the transfer matrix formalism in an explicit step-by-step approach inspired by…
The random field Ising model with Gaussian disorder is studied using a new Monte Carlo algorithm. The algorithm combines the advantanges of the replica exchange method and the two-replica cluster method and is much more efficient than the…