Related papers: Forest expansion of two-body partition functions f…
Using local detailed balance we rewrite the Kirchhoff formula for stationary distribution of Markov jump processes in terms of a physically interpretable tree-ensemble. We use that arborification of path-space integration to derive a…
We introduce a graph partitioning problem motivated by computational topology and propose two algorithms that produce approximate solutions. Specifically, given a weighted, undirected graph $G$ and a positive integer $k$, we desire to find…
A loop series expansion for the partition function of a general statistical model on a graph is carried out. If the auxiliary probability distributions of the expansion are chosen to be a fixed point of the belief-propagation equation, the…
We identify a sufficient condition, treewidth-pliability, that gives a polynomial-time algorithm for an arbitrarily good approximation of the optimal value in a large class of Max-2-CSPs parameterised by the class of allowed constraint…
The following measure of sparsity of multigraphs refining the maximum average degree: For $a>0$ and an arbitrary real $b$, a multigraph $H$ is \emph{$(a,b)$-sparse} if it is loopless and for every $A\subseteq V(H)$ with $|A|\geq 2$, the…
We develop fast approximation algorithms for the minimum-cost version of the Bounded-Degree MST problem (BD-MST) and its generalization the Crossing Spanning Tree problem (Crossing-ST). We solve the underlying LP to within a $(1+\epsilon)$…
In recent years, non-parametric methods utilizing random walks on graphs have been used to solve a wide range of machine learning problems, but in their simplest form they do not scale well due to the quadratic complexity. In this paper, a…
Long-range quantum systems, in which the interactions decay as $1/r^{\alpha}$, are of increasing interest due to the variety of experimental set-ups in which they naturally appear. Motivated by this, we study fundamental properties of…
In this paper, we present a general, multistage framework for graphical model approximation using a cascade of models such as trees. In particular, we look at the problem of covariance matrix approximation for Gaussian distributions as…
We present a general method for the high-temperature expansion of the self-energy of interacting particles. Though the method is valid for fermions and bosons, we illustrate it for spin one half fermions interacting via a zero range…
We perform an exact computation of the grand partition function of a model of confined quarks at arbitrary temperatures and quark chemical potentials. The model is inspired by a version of QCD where the perturbative BRST symmetry is broken…
In this paper, we present a quasi-polynomial time classical algorithm that estimates the partition function of quantum many-body systems at temperatures above the thermal phase transition point. It is known that in the worst case, the same…
Compression and sparsification algorithms are frequently applied in a preprocessing step before analyzing or optimizing large networks/graphs. In this paper we propose and study a new framework contracting edges of a graph (merging vertices…
We propose an approach for approximating the partition function which is based on two steps: (1) computing the partition function of a simplified model which is obtained by deleting model edges, and (2) rectifying the result by applying an…
An $({\cal I},{\cal F}_d)$-partition of a graph is a partition of the vertices of the graph into two sets $I$ and $F$, such that $I$ is an independent set and $F$ induces a forest of maximum degree at most $d$. We show that for all $M<3$…
An approximate numerical approach to spin models is proposed, in which the original lattice is transformed into a tree. This method is applied to the Edwards-Anderson spin glass model in two and three dimensions. It captures the…
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…
We study the thermal partition function of Jackiw-Teitelboim (JT) gravity in asymptotically Euclidean $AdS_2$ background using the matrix model description recently found by Saad, Shenker and Stanford [arXiv:1903.11115]. We show that the…
We propose a simple and natural approximation algorithm for the problem of finding a 2-edge-connected spanning subgraph of minimum total edge cost in a graph. The algorithm maintains a spanning forest starting with an empty edge set. In…
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…