Related papers: Approximating Pairwise Correlations in the Ising M…
We analyze the ferromagnetic Ising model on a scale-free tree; the growing random network model with the linear attachment kernel $A_k=k+\alpha$ introduced by [Krapivsky et al.: Phys. Rev. Lett. {\bf 85} (2000) 4629-4632]. We derive an…
We give fully polynomial-time approximation schemes (FPTAS) for the partition function of ferromagnetic 2-spin systems in certain parameter regimes. The threshold we obtain is almost tight up to an integrality gap. Our technique is based on…
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 study the two-dimensional antiferromagnetic Ising model with a purely imaginary magnetic field, which can be thought of as a toy model for the usual $\theta$ physics. Our motivation is to have a benchmark calculation in a system which…
We study classical Ising spin-$\frac{1}{2}$ models on the 2D square lattice with ferromagnetic or antiferromagnetic nearest-neighbor interactions, under the effect of a pure imaginary magnetic field. The complex Boltzmann weights of spin…
Modeling complex systems, like neural networks, simple liquids or flocks of birds, often works in reverse to textbook approaches: given data for which averages and correlations are known, we try to find the parameters of a given model…
High accuracy Monte Carlo simulation results for 1024*1024 Ising system with ferromagnetic impurity bonds are presented. Spin-spin correlation function at a critical point is found to be numerically very close to that of a pure system. This…
Randomly coupled Ising spins constitute the classical model of collective phenomena in disordered systems, with applications covering ferromagnetism, combinatorial optimization, protein folding, stock market dynamics, and social dynamics.…
We consider testing for the parameters of Ferromagnetic Ising models. While testing for the presence of possibly sparse magnetizations, we provide a general lower bound of minimax separation rates which yields sharp results in high…
We investigate analytically and numerically an Ising spin model with ferromagnetic coupling defined on random graphs corresponding to Feynman diagrams of a $\phi^q$ field theory, which exhibits a mean field phase transition. We explicitly…
In this paper we study the effect of dependence on detecting a class of structured signals in Ferromagnetic Ising models. Natural examples of our class include Ising Models on lattices, and Mean-Field type Ising Models such as dense…
We consider a family of quantum spin systems which includes as special cases the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any…
In the simple [hyper]cubic five dimension near neighbor interaction Ising ferromagnet, extensive simulation measurements are made of the link overlap and the spin overlap distributions. These "two replica" measurements are standard in the…
We study the mixing time of Glauber dynamics for Ising models in which the interaction matrix contains a single negative spectral outlier. This class includes the anti-ferromagnetic Curie-Weiss model, the anti-ferromagnetic Ising model on…
We formulate the conformal mapping between $R^3$ and $S^3$, the 3 sphere. This mapping is applied to the critical Ising model. From this mapping, we calculate the second and fourth moments of the magnetization density, and using those…
Inference in general Ising models is difficult, due to high treewidth making tree-based algorithms intractable. Moreover, when interactions are strong, Gibbs sampling may take exponential time to converge to the stationary distribution. We…
We give a fully polynomial-time randomised approximation scheme (FPRAS) for the number of bases in a bicircular matroids. This is a natural class of matroids for which counting bases exactly is #P-hard and yet approximate counting can be…
We investigate different ways of generating approximate solutions to the pairwise Markov random field (MRF) selection problem. We focus mainly on the inverse Ising problem, but discuss also the somewhat related inverse Gaussian problem…
Importance sampling (IS) is a Monte Carlo methodology that allows for approximation of a target distribution using weighted samples generated from another proposal distribution. Adaptive importance sampling (AIS) implements an iterative…
Recently, spatial photonic Ising machines (SPIM) have been demonstrated to compute the minima of Hamiltonians for large-scale spin systems. Here we propose to implement an antiferromagnetic model through optoelectronic correlation computing…