Related papers: Sampling from the antiferromagnetic Ising model on…
We study numerically the ordering kinetics in a two-dimensional Ising model with random coupling where the fraction of antiferromagnetic links $a$ can be gradually tuned. We show that, upon increasing such fraction, the behavior changes in…
Exponential random graph models have become increasingly important in the study of modern networks ranging from social networks, economic networks, to biological networks. They seek to capture a wide variety of common network tendencies…
We give a simple, multiplicative-weight update algorithm for learning undirected graphical models or Markov random fields (MRFs). The approach is new, and for the well-studied case of Ising models or Boltzmann machines, we obtain an…
Graphical model selection in Markov random fields is a fundamental problem in statistics and machine learning. Two particularly prominent models, the Ising model and Gaussian model, have largely developed in parallel using different (though…
We propose a method for efficient simulations in extended ensembles, useful, e.g., for the study of problems with complex energy landscapes and for free energy calculations. The main difficulty in such simulations is the estimation of the a…
We study a ferromagnetic Ising model on random graphs with a power-law degree distribution and compute the thermodynamic limit of the pressure when the mean degree is finite (degree exponent $\tau>2$), for which the random graph has a…
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…
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…
The partition function of a factor graph and the partition function of the dual factor graph are related to each other by the normal factor graph duality theorem. We apply this result to the classical problem of computing the partition…
The two-dimensional Ising model of a ferromagnet allows for many ways of computing its partition function and other properties. Each way reveals surprising features of what we might call Ising Matter. Moreover, the various ways would appear…
We use the cavity method to study parallel dynamics of disordered Ising models on a graph. In particular, we derive a set of recursive equations in single site probabilities of paths propagating along the edges of the graph. These equations…
A spin system is a framework in which the vertices of a graph are assigned spins from a finite set. The interactions between neighbouring spins give rise to weights, so a spin assignment can also be viewed as a weighted graph homomorphism.…
We study the analogy between buckled colloidal monolayers and the triangular-lattice Ising antiferromagnet. We calculate free volume-induced Ising interactions, show how lattice deformations favor zigzag stripes that partially remove the…
Algebraic topology studies topological spaces with the help of tools from abstract algebra. The main focus of this paper is to show that many concepts from algebraic topology can be conveniently expressed in terms of (normal) factor graphs.…
The number of independent sets in regular bipartite expander graphs can be efficiently approximated by expressing it as the partition function of a suitable polymer model and truncating its cluster expansion. While this approach has been…
The class of two-spin systems contains several important models, including random independent sets and the Ising model of statistical physics. We show that for both the hard-core (independent set) model and the anti-ferromagnetic Ising…
This paper deals with the partition function of the Ising model from statistical mechanics, which is used to study phase transitions in physical systems. A special case of interest is that of the Ising model with constant energies and…
An emerging trend in approximate counting is to show that certain `low-temperature' problems are easy on typical instances, despite worst-case hardness results. For the class of regular graphs one usually shows that expansion can be…
Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…
We have studied the magnetic relaxation behavior of a two-dimensional Ising ferromagnet by Monte Carlo simulation. Our primary goal is to investigate the effects of the system's geometry (area preserving) , boundary conditions, and…