Related papers: On Sampling from Ising Models with Spectral Constr…
Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models,…
We apply both a scalar field theory and a recently developed transfer-matrix method to study the stationary properties of metastability in a two-state model with weak, long-range interactions: the $N$$\times$$\infty$ quasi-one-dimensional…
We consider polynomial long-range Ising models in one dimension, with ferromagnetic pair interactions decaying with power $2-\alpha$ (for $0 \leq \alpha < 1$), and prepared with randomly chosen boundary conditions. We show that at low…
We present a polynomial-time Markov chain Monte Carlo algorithm for estimating the partition function of the antiferromagnetic Ising model on any line graph. The analysis of the algorithm exploits the "winding" technology devised by…
We consider a variant of Glauber dynamics of Ising spins on a one-dimensional lattice, where each spin flips according to the relative state of the spin to its left. Moreover, each bond allows for two rates; flips which equalize nearest…
Graph pattern matching is a routine process for a wide variety of applications such as social network analysis. It is typically defined in terms of subgraph isomorphism which is NP-Complete. To lower its complexity, many extensions of graph…
We consider Glauber dynamics of classical spin systems of Ising type in the limit when the temperature tends to zero in finite volume. We show that information on the structure of the most profound minima and the connecting saddle points of…
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 give a survey of the known results on mixing time of Glauber dynamics for the Ising model on the square lattice and present a technique that makes exact sampling of the Ising model at all temperatures possible in polynomial time. At high…
Analog Ising machines have been proposed as heuristic hardware solvers for combinatorial optimization problems, with the potential to outperform conventional approaches, provided that their hyperparameters are carefully tuned. Their…
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions…
Ising machines (IM) are physics-inspired alternatives to von Neumann architectures for solving hard optimization tasks. By mapping binary variables to coupled Ising spins, IMs can naturally solve unconstrained combinatorial optimization…
Ising model is a widely studied class of models in quantum computation. In this paper we investigate the computational characteristics of the random field Ising model (RFIM) with long-range interactions that decays as an inverse polynomial…
Contrary to the actual nonlinear Glauber model (NLGM), the linear Glauber model (LGM) is exactly solvable, although the detailed balance condition is not generally satisfied. This motivates us to address the issue of writing the transition…
We simulate the $N$-spin critical Ising model on a square lattice using Glauber dynamics and consider the typical one-unit time equal to $N$ single-spin-flip attempts. The divergence of correlation time with the linear extent of the system…
We study the problem of approximating the eigenspectrum of a symmetric matrix $\mathbf A \in \mathbb{R}^{n \times n}$ with bounded entries (i.e., $\|\mathbf A\|_{\infty} \leq 1$). We present a simple sublinear time algorithm that…
In this paper, we derive the limit of experiments for one parameter Ising models on dense regular graphs. In particular, we show that the limiting experiment is Gaussian in the low temperature regime, non Gaussian in the critical regime,…
We present novel results for fast mixing of Glauber dynamics using the newly introduced and powerful Spectral Independence method from [Anari, Liu, Oveis-Gharan: FOCS 2020]. We mainly focus on the Hard-core model and the Ising model. We…
Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…
The maximum independent set (MIS) problem is a well-studied combinatorial optimization problem that naturally arises in many applications, such as wireless communication, information theory and statistical mechanics. MIS problem is NP-hard,…