相关论文: Forest expansion of two-body partition functions f…
The burning number of a graph $G$ is the smallest number $b$ such that the vertices of $G$ can be covered by balls of radii $0, 1, \dots, b-1$. As computing the burning number of a graph is known to be NP-hard, even on trees, it is natural…
We consider sampling in the so-called low-temperature regime, which is typically characterised by non-local behaviour and strong global correlations. Canonical examples include sampling independent sets on bipartite graphs and sampling from…
We present approximation algorithms for the following NP-hard optimization problems related to bottleneck spanning trees in metric spaces. 1. The disjoint bottleneck spanning tree problem: Given $n$ pairs of points in a metric space, find…
We consider the problem of approximating the partition function of the hard-core model on planar graphs of degree at most 4. We show that when the activity lambda is sufficiently large, there is no fully polynomial randomised approximation…
We show that the one-loop effective action at finite temperature for a scalar field with quartic interaction has the same renormalized expression as at zero temperature if written in terms of a certain classical field $\phi_c$, and if we…
We express the partition functions of the spanning tree on finite square lattices under five different sets of boundary conditions (free, cylindrical, toroidal, M\"obius strip, and Klein bottle) in terms of a principal partition function…
Methods for understanding classical disordered spin systems with interactions conforming to some idealized graphical structure are well developed. The equilibrium properties of the Sherrington-Kirkpatrick model, which has a densely…
Diamond "lattices" are sequences of recursively-defined graphs that provide a network of directed pathways between two fixed root nodes, $A$ and $B$. The construction recipe for diamond graphs depends on a branching number $b\in \mathbb{N}$…
The Bethe approximation, or loopy belief propagation algorithm is a successful method for approximating partition functions of probabilistic models associated with a graph. Chertkov and Chernyak derived an interesting formula called Loop…
A common subgraph of two graphs $G_1$ and $G_2$ is a graph that is isomorphic to subgraphs of $G_1$ and $G_2$. In the largest common subgraph problem the task is to determine a common subgraph for two given graphs $G_1$ and $G_2$ that is of…
Twin-width is a structural width parameter introduced by Bonnet, Kim, Thomass\'e and Watrigant [FOCS 2020]. Very briefly, its essence is a gradual reduction (a contraction sequence) of the given graph down to a single vertex while…
We present a detailed study of simple `tree' models for off equilibrium dynamics and aging in glassy systems. The simplest tree describes the landscape of a random energy model, whereas multifurcating trees occur in the solution of the…
Algorithms for binary classification based on adaptive tree partitioning are formulated and analyzed for both their risk performance and their friendliness to numerical implementation. The algorithms can be viewed as generating a set…
We study the ground states of the pieces' model in the Fermi-Dirac statistics in the thermodynamic limit. In other words, we consider the minimizing configurations of $ n $ interacting fermions in an interval $ \Lambda $ divided into pieces…
We study the arboricity A and the maximum number T of edge-disjoint spanning trees of the Erdos-Renyi random graph G(n,p). For all p(n) in [0,1], we show that, with high probability, T is precisely the minimum between delta and…
We present a new tensor network algorithm for calculating the partition function of interacting quantum field theories in 2 dimensions. It is based on the Tensor Renormalization Group (TRG) protocol, adapted to operate entirely at the level…
Sparse approximations using highly over-complete dictionaries is a state-of-the-art tool for many imaging applications including denoising, super-resolution, compressive sensing, light-field analysis, and object recognition. Unfortunately,…
The virial expansion method is applied within a harmonic approximation to an interacting N-body system of identical fermions. We compute the canonical partition functions for two and three particles to get the two lowest orders in the…
We study approximations of the partition function of dense graphical models. Partition functions of graphical models play a fundamental role is statistical physics, in statistics and in machine learning. Two of the main methods for…
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estimation, we do not assume the true distribution corresponds to…