相关论文: Forest expansion of two-body partition functions f…

The partition function on the three-sphere of N=3 Chern-Simons-matter theories can be formulated in terms of an ideal Fermi gas. In this paper we show that, in theories with N=2 supersymmetry, the partition function corresponds to a gas of…

We consider the many-body quantum Gibbs state for the Bose-Hubbard model on a finite graph at positive temperature. We scale the interaction with the inverse temperature, corresponding to a mean-field limit where the temperature is of the…

Using a mapping of compact polymers on the Manhattan lattice to spanning trees, we calculate exactly the average number of bends at infinite temperature. We then find, in a high temperature approximation, the energy of the system as a…

We provide an explicit formula for the limiting free energy density (log-partition function divided by the number of vertices) for ferromagnetic Potts models on uniformly sparse graph sequences converging locally to the d-regular tree for d…

In the spanning tree congestion problem, given a connected graph $G$, the objective is to compute a spanning tree $T$ in $G$ that minimizes its maximum edge congestion, where the congestion of an edge $e$ of $T$ is the number of edges in…

In this paper we consider alignment of sparse graphs, for which we introduce the Neighborhood Tree Matching Algorithm (NTMA). For correlated Erd\H{o}s-R\'{e}nyi random graphs, we prove that the algorithm returns -- in polynomial time -- a…

We introduce and study the general problem of finding a most "scale-free-like" spanning tree of a connected graph. It is motivated by a particular problem in epidemiology, and may be useful in studies of various dynamical processes in…

We introduce a new notion of equivalence of discrete Morse functions on graphs called persistence equivalence. Two functions are considered persistence equivalent if and only if they induce the same persistence diagram. We compare this…

The Bethe approximation is a successful method for approximating partition functions of probabilistic models associated with a graph. Recently, Chertkov and Chernyak derived an interesting formula called Loop Series Expansion, which is an…

In recent years, spectral graph sparsification techniques that can compute ultra-sparse graph proxies have been extensively studied for accelerating various numerical and graph-related applications. Prior nearly-linear-time spectral…

Tree rotations (left and right) are basic local deformations allowing to transform between two unlabeled binary trees of the same size. Hence, there is a natural problem of practically finding such transformation path with low number of…

We study the high temperature (or small inverse temperature $\beta$) expansion of the free energy of double scaled SYK model. We find that this expansion is a convergent series with a finite radius of convergence. It turns out that the…

Exact and approximate expressions for thermodynamic characteristics of heated matter, which consists of particles with finite mass-widths, are constructed. They are expressed in terms of Fermi/Bose distributions and spectral functions,…

We investigate the computation of minimum-cost spanning trees satisfying prescribed vertex degree constraints: Given a graph $G$ and a constraint function $D$, we ask for a (minimum-cost) spanning tree $T$ such that for each vertex $v$, $T$…

We develop exact, simple closed form expressions for partition functions associated with relativistic bosons and fermions in odd spatial dimensions. These expressions, valid at high temperature, include the effects of a non-trivial Polyakov…

We study partition functions and thermodynamic limits for the Ising model on three families of finite graphs converging to infinite self-similar graphs. They are provided by three well-known groups realized as automorphism groups of regular…

Branchwidth determines how graphs, and more generally, arbitrary connectivity (basically symmetric and submodular) functions could be decomposed into a tree-like structure by specific cuts. We develop a general framework for designing…

The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree $T$ for graph $G=(V,E)$ with $n$ vertices, such that the maximum degree $d$ of $T$ is the smallest among all spanning trees of $G$. In this paper,…

The paper is devoted to sufficient conditions for the existence of vertex cuts in simple graphs, where the induced subgraph on the cut vertices belongs to a specified graph class. In particular, we show that any connected graph with $n$…

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…