相关论文: A short proof of the Kac-Ward formula
The Kac-Ward formula allows to compute the Ising partition function on a planar graph G with straight edges from the determinant of a matrix of size 2N, where N denotes the number of edges of G. In this paper, we extend this formula to any…
A streamlined derivation of the Kac-Ward formula for the planar Ising model's partition function is presented and applied in relating the kernel of the Kac-Ward matrices' inverse with the correlation functions of the Ising model's…
The Kac-Ward formula allows to compute the Ising partition function on any finite graph G from the determinant of 2^{2g} matrices, where g is the genus of a surface in which G embeds. We show that in the case of isoradially embedded graphs…
We provide a concise exposition with original proofs of combinatorial formulas for the 2D Ising model partition function, multi-point fermionic observables, spin and energy density correlations, for general graphs and interaction constants,…
We give a Pfaffian formula to compute the partition function of the Ising model on any graph $G$ embedded in a closed, possibly non-orientable surface. This formula, which is suitable for computational purposes, is based on the relation…
Livine and Bonzom recently proposed a geometric formula for a certain set of complex zeros of the partition function of the Ising model defined on planar graphs. Remarkably, the zeros depend locally on the geometry of an immersion of the…
We propose the Kazakov-Migdal model on graphs and show that, when the parameters of this model are appropriately tuned, the partition function is represented by the unitary matrix integral of an extended Ihara zeta function, which has a…
We prove optimality of the Arf invariant formula for the generating function of even subgraphs, or, equivalently, the Ising partition function, of a graph.
We investigate the spectral radius and operator norm of the Kac-Ward transition matrix for the Ising model on a general planar graph. We then use the obtained results to identify regions in the complex plane where the free energy density…
We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…
We present a simple construction that maps quantum circuits to graphs and vice-versa. Inspired by the results of D.A. Lidar linking the Ising partition function with quadratically signed weight enumerators (QWGTs), we also present a…
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…
An integral representation of the partition function for general $n$-dimensional Ising models with nearest or non-nearest neighbours interactions is given. The representation is used to derive some properties of the partition function. An…
We produce a new, shorter construction of a minor-universal planar graph.
In this paper we propose and realize (the code is publicly available at https://github.com/Thrawn1985/2D-Partition-Function) an algorithm for exact calculation of partition function for planar graph models with binary spins. The complexity…
We derive an exact path integral formulation for the partition function for the Ising model using a mapping between spins and poles of a Laurent expansion for a field on the complex plane. The advantage in using this formulation for 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 conformal invariance and universality results of Chelkak-Smirnov on the two-dimensional Ising model hold for isoradial planar graphs with critical weights. Motivated by the problem of extending these results to a wider class of graphs,…
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…
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…