Related papers: The complexity of approximating the complex-valued…
The transverse-field Ising model is widely studied as one of the simplest quantum spin systems. It is known that this model exhibits a phase transition at the critical inverse temperature $\beta_{\mathrm{c}}$, which is determined by the…
We consider the problem of estimating inverse temperature parameter $\beta$ of an $n$-dimensional truncated Ising model using a single sample. Given a graph $G = (V,E)$ with $n$ vertices, a truncated Ising model is a probability…
The hyperbolicity of a graph, informally, measures how close a graph is (metrically) to a tree. Hence, it is intuitively similar to treewidth, but the measures are formally incomparable. Motivated by the broad study of algorithms and…
On any locally-finite geometry, the stochastic Ising model is known to be contractive when the inverse-temperature $\beta$ is small enough, via classical results of Dobrushin and of Holley in the 1970's. By a general principle proposed by…
We apply a new updating algorithm scheme to investigate the critical behavior of the two-dimensional ferromagnetic Ising model on a triangular lattice with nearest neighbour interactions. The transition is examined by generating accurate…
We devise a geometric description of bounded systems at criticality in any dimension $d$. This is achieved by altering the flat metric with a space dependent scale factor $\gamma(x)$, $x$ belonging to a general bounded domain $\Omega$.…
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…
Understanding the relationship which integrable (solvable) models, all of which possess very special symmetry properties, have with the generic non-integrable models that are used to describe real experiments, which do not have the symmetry…
When belief propagation (BP) converges, it does so to a stationary point of the Bethe free energy $F$, and is often strikingly accurate. However, it may converge only to a local optimum or may not converge at all. An algorithm was recently…
Counting the number of independent sets for a bipartite graph (#BIS) plays a crucial role in the study of approximate counting. It has been conjectured that there is no fully polynomial-time (randomized) approximation scheme (FPTAS/FPRAS)…
A well known theorem due to Kasteleyn states that the partition function of an Ising model on an arbitrary planar graph can be represented as the Pfaffian of a skew-symmetric matrix associated to the graph. This results both embodies the…
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…
The Ising model was generalized to a system of cells interacting exclusively by presence of shared spins. Within the cells there are interactions of any complexity, the simplest intracell interactions come down to the Ising model. The…
While the Ising model remains essential to understand physical phenomena, its natural connection to combinatorial reasoning makes it also one of the best models to probe complex systems in science and engineering. We bring a computational…
We have performed multicanonical simulations to study the critical behavior of the two-dimensional Ising model with dipole interactions. This study concerns the thermodynamic phase transitions in the range of the interaction \delta where…
We consider the communication complexity of finding an approximate maximum matching in a graph in a multi-party message-passing communication model. The maximum matching problem is one of the most fundamental graph combinatorial problems,…
We derive an exact path integral formulation for the partition function for the Ising model using a mapping between spins and poles of a Laurent expansion for a field on the complex plane. The advantage in using this formulation for the…
In extension problems of partial graph drawings one is given an incomplete drawing of an input graph $G$ and is asked to complete the drawing while maintaining certain properties. A prominent area where such problems arise is that of…
We present a Weitz-type FPTAS for the ferromagnetic Ising model across the entire Lee--Yang zero-free region, without relying on the strong spatial mixing (SSM) property. Our algorithm is Weitz-type for two reasons. First, it expresses the…
Employing heuristic susceptibility equations in conjunction with the well-known critical exponents, the magnetization and partition function for two-dimensional nearest neighbour Ising models are formulated in terms of the Gauss…