相关论文: Virial Expansion Bounds Through Tree Partition Sch…

We revisit the expansion recently proposed by Pulvirenti and Tsagkarogiannis for a system of $N$ continuous particles in the canonical ensemble. Under the sole assumption that the particles interact via a tempered and stable pair potential…

Polynomial convergence bounds are considered for left, right, and split preconditioned GMRES. They include the cases of Weighted and Deflated GMRES for a linear system Ax = b. In particular, the case of positive definite A is considered.…

In Aldous and Shields (1988), a model for a rooted, growing random binary tree was presented. For some c>0, an external vertex splits at rate c^(-i) (and becomes internal) if its distance from the root (depth) is i. For c>1, we reanalyse…

Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual parameters that are often used as heuristic estimates of the marginal…

In this paper, we investigate a divide and conquer approach to Kernel Ridge Regression (KRR). Given n samples, the division step involves separating the points based on some underlying disjoint partition of the input space (possibly via…

We present a general method for obtaining strong bounds for discrete optimization problems that is based on a concept of branching duality. It can be applied when no useful integer programming model is available, and we illustrate this with…

Tree-decompositions and treewidth are of fundamental importance in structural and algorithmic graph theory. The "spread" of a tree-decomposition is the minimum integer $s$ such that every vertex lies in at most $s$ bags. A…

Graphs with bounded treewidth and bounded maximum degree are known to have tree-partitions of bounded width. What can be said if the bounded treewidth assumption is strengthened to bounded pathwidth? We prove that every graph with bounded…

We prove a novel inversion theorem for functionals given as power series in infinite-dimensional spaces and apply it to the inversion of the density-activity relation for inhomogeneous systems. This provides a rigorous framework to prove…

Partitioning a graph using graph separators, and particularly clique separators, are well-known techniques to decompose a graph into smaller units which can be treated independently. It was previously known that the treewidth was bounded…

We study the limiting degree distribution of the vertex splitting model introduced in \cite{DDJS:2009}. This is a model of randomly growing ordered trees, where in each time step the tree is separated into two components by splitting a…

A "tree-partition" of a graph $G$ is a partition of $V(G)$ such that identifying the vertices in each part gives a tree. It is known that every graph with treewidth $k$ and maximum degree $\Delta$ has a tree-partition with parts of size…

We consider a multivariate distributional recursion of sum-type as arising in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's bounding technique by estimating the…

We develop a graphical method for computing the virial expansion coefficients for a nonrelativistic quantum field theory. As an example we compute the third virial coefficient b3 for unitary fermions, a nonperturbative system. By…

Weil's theorem gives the most standard bound on the number of points of a curve over a finite field. This bound was improved by Ihara and Oesterl\'e for larger genus. Recently, Hallouin and Perret gave a new point of view on these bounds,…

Mayer's convergence method for virial expansion and condensation is studied using a new generating function for canonical partition function, which directly depends on irreducible cluster integral, $\beta_k$, unlike Mayer's work where it…

We express Wronskian Hermite polynomials in the Hermite basis and obtain an explicit formula for the coefficients. From this we deduce an upper bound for the modulus of the roots in the case of partitions of length 2. We also derive a…

We propose Partition Tree, a novel tree-based framework for conditional density estimation over general outcome spaces that supports both continuous and categorical variables within a unified formulation. Our approach models conditional…

This is an expository note answering a question posed to us by Richard Stanley, in which we prove a limit shape theorem for partitions of $n$ which maximize the number of subpartitions. The limit shape and the growth rate of the number of…

In this note we deduce a new lower bound for the convergence radius of the Virial series of a continuous system of classical particles interacting via a stable and tempered pair potential using the estimates on the Mayer coefficients…