Related papers: The complexity of approximating the complex-valued…
We consider a one-dimensional lattice of Ising-type variables where the ferromagnetic exchange interaction J between neighboring sites is frustrated by a long-ranged anti-ferromagnetic interaction of strength g between the sites i and j,…
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 study the classical and parameterized complexity of computing the positive non-clashing teaching dimension of a set of concepts, that is, the smallest number of examples per concept required to successfully teach an intelligent learner…
The stacking problem is approached by computational mechanics, using an Ising next nearest neighbor model. Computational mechanics allows to treat the stacking arrangement as an information processing system in the light of a symbol…
The Ising model with ferromagnetic interactions that decay as $1/r^\alpha$ is analyzed in the non-extensive regime $0\leq\alpha\leq d$, where the thermodynamic limit is not defined. In order to study the asymptotic properties of the model…
The two-dimensional Ising model is the simplest model of statistical mechanics exhibiting a second order phase transition. While in absence of magnetic field it is known to be solvable on the lattice since Onsager's work of the forties,…
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…
We consider the problem of high-dimensional Ising (graphical) model selection. We propose a simple algorithm for structure estimation based on the thresholding of the empirical conditional variation distances. We introduce a novel criterion…
Both the antiferromagnetic Ising model and the hard-core model could be said to be tractable on line graphs of bounded degree. For example, Glauber dynamics is rapidly mixing in both cases. In the case of the hard-core model, we know that…
The Ising model at inverse temperature $\beta$ and zero external field can be obtained via the Fortuin-Kasteleyn (FK) random-cluster model with $q=2$ and density of open edges $p=1-e^{-\beta}$ by assigning spin +1 or -1 to each vertex in…
The Ising model is widely regarded as the most studied model of spin-systems in statistical physics. The focus of this paper is its dynamic (stochastic) version, the Glauber dynamics, introduced in 1963 and by now the most popular means of…
In this study, we present a novel analytical approach to solving large-scale Ising problems by reformulating the discrete Ising Hamiltonian into a continuous framework. This transformation enables us to derive exact solutions for a…
Consider the nearest-neighbor Ising model on $\Lambda_n:=[-n,n]^d\cap\mathbb{Z}^d$ at inverse temperature $\beta\geq 0$ with free boundary conditions, and let $Y_n(\sigma):=\sum_{u\in\Lambda_n}\sigma_u$ be its total magnetization. Let $X_n$…
We consider the problem of learning the underlying graph of an unknown Ising model on p spins from a collection of i.i.d. samples generated from the model. We suggest a new estimator that is computationally efficient and requires a number…
In this work we present a thorough analysis of the phase transitions that occur in a ferromagnetic 2D Ising model, with only nearest-neighbors interactions, in the framework of the Tsallis nonextensive statistics. We performed Monte Carlo…
In this article we show the convergence of a loop ensemble of interfaces in the FK Ising model at criticality, as the lattice mesh tends to zero, to a unique conformally invariant scaling limit. The discrete loop ensemble is described by a…
Comprehending the connections between the geometric, topological, and dynamical structures of integrable quantum systems with quantum phenomena exploitable in quantum information tasks, such as quantum entanglement, is a major problem in…
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…
Using Monte Carlo techniques, Ising models with ferromagnetic nearest-neighbor interactions on a simple cubic lattice are studied. At the surface transition, the critical exponent $\beta_2$ of the edge magnetization is found to be…
We explore the analytic structure of the non-perturbative S-matrix in arguably the simplest family of massive non-integrable quantum field theories: the Ising field theory (IFT) in two dimensions, which may be viewed as the Ising CFT…