相关论文: Critical Ising model and spanning trees partition …
We study the problem of approximating the partition function of the ferromagnetic Ising model in graphs and hypergraphs. Our first result is a deterministic approximation scheme (an FPTAS) for the partition function in bounded degree graphs…
The critical 2d classical Ising model on the square lattice has two topological conformal defects: the $\mathbb{Z}_2$ symmetry defect $D_{\epsilon}$ and the Kramers-Wannier duality defect $D_{\sigma}$. These two defects implement…
We analyze the partition function of the Ising model on graphs of two different types: complete graphs, wherein all nodes are mutually linked and annealed scale-free networks for which the degree distribution decays as $P(k)\sim…
We study the critical Ising model with free boundary conditions on finite domains in $\mathbb{Z}^d$ with $d\geq4$. Under the assumption, so far only proved completely for high $d$, that the critical infinite volume two-point function is of…
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 study the hard-core model defined on independent sets, where each independent set I in a graph G is weighted proportionally to $\lambda^{|I|}$, for a positive real parameter $\lambda$. For large $\lambda$, computing the partition…
We study the complexity of approximating the partition function of dense Ising models in the critical regime. Recent work of Chen, Chen, Yin, and Zhang (FOCS 2025) established fast mixing at criticality, and even beyond criticality in a…
An edge (vertex) cut $X$ of $G$ is $r$-essential if $G-X$ has two components each of which has at least $r$ edges. A graph $G$ is $r$-essentially $k$-edge-connected (resp. $k$-connected) if it has no $r$-essential edge (resp. vertex) cuts…
In 1944 Lars Onsager published the exact partition function of the ferromagnetic Ising model on the infinite square lattice in terms of a definite integral. Only in the literature of the last decade, however, has it been recast in terms of…
The model of p Ising spins coupled to 2d gravity, in the form of a sum over planar phi-cubed graphs, is studied and in particular the two-point and spin-spin correlation functions are considered. We first solve a toy model in which only a…
With a graph $G=(V,E)$ we associate a collection of non-negative real weights $\cup_{v\in V}{\lambda_{i,v}:1\leq i \leq m} \cup \cup_{uv \in E} {\lambda_{ij,uv}:1\leq i \leq j \leq m}$. We consider the probability distribution on…
Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds:…
A three dimensional string model is analyzed in the strong coupling regime. The contribution of surfaces with different topology to the partition function is essential. A set of corresponding models is discovered. Their critical indices,…
The fractal structure of high-temperature graphs of the three-dimensional Ising and XY models is investigated by simulating these graphs directly on a cubic lattice and analyzing them with the help of percolation observables. The Ising…
We study mappings between distinct classical spin systems that leave the partition function invariant. As recently shown in [Phys. Rev. Lett. 100, 110501 (2008)], the partition function of the 2D square lattice Ising model in the presence…
The partition function (quantum transition amplitude) of the gauge system with gauge group $Z_2$ coupled with Majorana fermions is calculated on the regular 3D cubic lattice.
Closed-form expressions are obtained for the partition function of the Ising model on an M x N simple-quartic lattice embedded on a Moebius strip and a Klein bottle for finite M and N. The finite-size effects at criticality are analyzed and…
Given a weighted graph $G=(V,E)$ with weight functions $c:E\to \mathbb{R}_+$ and $\pi:V\to \mathbb{R}_+$, and a subset $U\subseteq V$, the normalized cut value for $U$ is defined as the sum of the weights of edges exiting $U$ divided by the…
Undirected graphical models have many applications in such areas as machine learning, image processing, and, recently, psychology. Psychopathology in particular has received a lot of attention, where symptoms of disorders are assumed to…
Recent inapproximability results of Sly (2010), together with an approximation algorithm presented by Weitz (2006) establish a beautiful picture for the computational complexity of approximating the partition function of the hard-core…