Related papers: A generalized Kac-Ward formula
We give the first analysis of the computational complexity of {\it coalition structure generation over graphs}. Given an undirected graph $G=(N,E)$ and a valuation function $v:2^N\rightarrow\RR$ over the subsets of nodes, the problem is to…
We present a computational and statistical approach for fitting isotonic models under convex differentiable loss functions. We offer a recursive partitioning algorithm which provably and efficiently solves isotonic regression under any such…
Let $G$ be a connected graph and let $\mathbb{X}$ be the set of projective points defined by the column vectors of the incidence matrix of $G$ over a field $K$ of any characteristic. We determine the generalized Hamming weights of the…
An equitable $k$-partition of a graph $G$ is a collection of induced subgraphs $(G[V_1],G[V_2],\ldots,G[V_k])$ of $G$ such that $(V_1,V_2,\ldots,V_k)$ is a partition of $V(G)$ and $-1\le |V_i|-|V_j|\le 1$ for all $1\le i<j\le k$. We prove…
We present a new approach to a classical problem in statistical physics: estimating the partition function and other thermodynamic quantities of the ferromagnetic Ising model. Markov chain Monte Carlo methods for this problem have been…
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…
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:…
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions…
The partition function of the square lattice Ising model on the rectangle with open boundary conditions in both directions is calculated exactly for arbitrary system size $L\times M$ and temperature. We start with the dimer method of…
A new and efficient algorithm is presented for the calculation of the partition function in the $S=\pm 1$ Ising model. As an example, we use the algorithm to obtain the thermal dependence of the magnetic spin susceptibility of an Ising…
The Grassmann path integral approach is used to calculate exact partition functions of the Ising model on MxN square (sq), plane triangular (pt) and honeycomb (hc) lattices with periodic-periodic (pp), periodic-antiperiodic (pa),…
We consider the Itzykson-Zuber-Eynard-Mehta two-matrix model and prove that the partition function is an isomonodromic tau function in a sense that generalizes Jimbo-Miwa-Ueno's. In order to achieve the generalization we need to define a…
The Hilbert spaces of matrix quantum mechanical systems with $N \times N$ matrix degrees of freedom $ X $ have been analysed recently in terms of $S_N$ symmetric group elements $U$ acting as $X \rightarrow U X U^T $. Solvable models have…
In 1944 Onsager published the formula for the partition function of the Ising model for the infinite square lattice. He was able to express the internal energy in terms of a special function, but he left the free energy as a definite…
We discuss the notion of s-embeddings $\mathcal{S}=\mathcal{S}_\mathcal{X}$ of planar graphs carrying a nearest-neighbor Ising model. The construction of $\mathcal{S}_\mathcal{X}$ is based upon a choice of a global complex-valued solution…
Today, the Ising model is an archetype describing collective ordering processes. And, as such, it is widely known in physics and far beyond. Less known is the fact that the thesis defended by Ernst Ising 100 years ago (in 1924) contained…
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 consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods…
The monopole-dimer model is a signed variant of the monomer-dimer model which has determinantal structure. We extend the monopole-dimer model for planar graphs (Math. Phys. Anal. Geom., 2015) to Cartesian products thereof and show that the…
The fast assembling of stiffness and mass matrices is a key issue in isogeometric analysis, particularly if the spline degree is increased. We present two algorithms based on the idea of sum factorization, one for matrix assembling and one…