Related papers: Geometric properties of the complete-graph Ising m…
The Ising model is important in statistical modeling and inference in many applications, however its normalizing constant, mean number of active vertices and mean spin interaction -- quantities needed in inference -- are computationally…
We prove rapid mixing of the Prokofiev-Svistunov (or worm) algorithm for the zero-field ferromagnetic Ising model, on all finite graphs and at all temperatures. As a corollary, we show how to rigorously construct simple and efficient…
We derive the exact actions of the $Q$-state Potts model valid on any graph, first for the spin degrees of freedom, and second for the Fortuin-Kasteleyn clusters. In both cases the field is a traceless $Q$-component scalar field…
A number of interesting features of the ground states of quantum spin chains are analized with the help of a functional integral representation of the system's equilibrium states. Methods of general applicability are introduced in the…
We find an exact mapping from the generalized Ising models with many-spin interactions to equivalent Boltzmann machines, i.e., the models with only two-spin interactions between physical and auxiliary binary variables accompanied by local…
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…
We present results from Monte Carlo simulations to test for ultrametricity and clustering properties in spin-glass models. By using a one-dimensional Ising spin glass with random power-law interactions where the universality class of the…
The paper discusses the transformation of decorated Ising models into an effective \textit{undecorated} spin models, using the most general Hamiltonian for interacting Ising models including a long range and high order interactions. The…
We present a systematic analysis of quantum Heisenberg-, XY- and interchange models on the complete graph. These models exhibit phase transitions accompanied by spontaneous symmetry breaking, which we study by calculating the generating…
The statistical mechanics of a two-state Ising spin-glass model with finite random connectivity, in which each site is connected to a finite number of other sites, is extended in this work within the replica technique to study the phase…
The fractal dimensions and the percolation exponents of the geometrical spin clusters of like sign at criticality, are obtained numerically for an Ising model with temperature-dependent annealed bond dilution, also known as the thermalized…
The cluster state acquired by evolving the nearest-neighbor (NN) Ising model from a completely separable state is the resource for measurement-based quantum computation. Instead of an NN system, a variable-range power law interacting Ising…
We present an algorithm which calculates groundstates of Ising spin glasses approximately. It works by randomly selecting clusters of spins which exhibit no frustrations. The spins which were not selected, contribute to the local fields of…
A sampling algorithm is presented that generates spin glass configurations of the 2D Edwards-Anderson Ising spin glass at finite temperature, with probabilities proportional to their Boltzmann weights. Such an algorithm overcomes the slow…
We present an algorithm for the optimization and thermal equilibration of spin glasses - or more generally, cost functions of the Ising form $H=\sum_{\langle i j\rangle} J_{ij} s_i s_j + \sum_i h_i s_i$, defined on graphs with arbitrary…
A promising paradigm of quantum computing for achieving practical quantum advantages is quantum annealing or quantum approximate optimization algorithm, where the classical problems are encoded in Ising interactions. However, it is…
We study the critical behavior of a general class of cubic-symmetric spin systems in which disorder preserves the reflection symmetry $s_a\to -s_a$, $s_b\to s_b$ for $b\not= a$. This includes spin models in the presence of random…
In the second article of this series, we establish the convergence of the loop ensemble of interfaces in the random cluster Ising model to a conformal loop ensemble (CLE) --- thus completely describing the scaling limit of the model in…
The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing…
It is well known that the SU(2)-gauge invariant phase space of loop gravity can be represented in terms of twisted geometries. These are piecewise-linear-flat geometries obtained by gluing together polyhedra, but the resulting geometries…