Related papers: Ferromagnetic Ising Measures on Large Locally Tree…

Partition functions are an important research object in combinatorics and mathematical physics [Barvinok, 2016]. In this work, we consider the partition function of the Ising antiferromagnet on random regular graphs and characterize its…

In this present paper, the recurrence equations of an Ising model with three coupling constants on a third-order Cayley tree are obtained. Paramagnetic and ferromagnetic phases associated with the Ising model are characterized. Types of…

We prove that the local limit of the weighted spanning trees on any simple connected high degree almost regular sequence of electric networks is the Poisson(1) branching process conditioned to survive forever, by generalizing [NP22] and…

Assign i.i.d. standard exponential edge weights to the edges of the complete graph K_n, and let M_n be the resulting minimum spanning tree. We show that M_n converges in the local weak sense (also called Aldous-Steele or Benjamini-Schramm…

We continue our analysis of Ising models on the (directed) Erd\H{o}s-R\'enyi random graph $G(N,p)$. We prove a quenched Central Limit Theorem for the magnetization and describe the fluctuations of the log-partition function. In the current…

In a seminal paper (Weitz, 2006), Weitz gave a deterministic fully polynomial approximation scheme for count- ing exponentially weighted independent sets (equivalently, approximating the partition function of the hard-core model from…

Consider random $d$-regular graphs, i.e., random graphs such that there are exactly $d$ edges from each vertex for some $d\ge 3$. We study both the configuration model version of this graph, which has occasional multi-edges and self-loops,…

Consider a statistical physical model on the $d$-regular infinite tree $T_{d}$ described by a set of interactions $\Phi$. Let $\{G_{n}\}$ be a sequence of finite graphs with vertex sets $V_n$ that locally converge to $T_{d}$. From $\Phi$…

In this article, we study concave recursions on trees, which appear widely in information theory through algorithms such as belief propagation, and in statistical mechanics through models on tree-like graphs, including the Ising model,…

We give a near-linear time sampler for the Gibbs distribution of the ferromagnetic Ising models with edge activities $\boldsymbol{\beta} > 1$ and external fields $\boldsymbol{\lambda}<1$ (or symmetrically, $\boldsymbol{\lambda}>1$) on…

We consider the ferromagnetic Ising model with Glauber spin flip dynamics in one dimension. The external magnetic field vanishes and the couplings are i.i.d. random variables. If their distribution has compact support, the disorder averaged…

We study the critical Ising model on the square lattice in bounded simply connected domains with + and free boundary conditions. We relate the energy density of the model to a fermionic observable and compute its scaling limit by discrete…

We investigate the statistical mechanics of the periodic one-dimensional Ising chain when the number of positive spins is constrained to be either an even or an odd number. We calculate the partition function using a generalization of the…

We consider the scaling limit of a generic ferromagnetic system with a continuous phase transition, on the half plane with boundary conditions leading to the equilibrium of two different phases below criticality. We use general properties…

In the present paper, the Ising model with mixed spin-(1,1/2) is considered on the second order Cayley tree. A construction of splitting Gibbs measures corresponding the model is given which allows to establish the existence of the phase…

We present a brief survey of rigorous results on the asymptotic behavior of correlations between two local functions as the distance between their support diverges, concentrating on the Ising model on $\mathbb{Z}^d$ with finite-range…

We present results from extensive Monte Carlo (MC) simulations of domain growth in ferromagnets and binary mixtures with quenched disorder. These are modeled by the "random-bond Ising model" and the "dilute Ising model" with either…

How complex is an Ising model? Usually, this is measured by the computational complexity of its ground state energy problem. Yet, this complexity measure only distinguishes between planar and non-planar interaction graphs, and thus fails to…

In this paper we prove the existence of phase transitions at finite temperature for O(n) classical ferromagnetic spin models on infrared finite graphs. Infrared finite graphs are infinite graphs with $\lim {m\to 0^+} {\bar Tr (L+m)^{-1} <…

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…