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

This work is concerned with forest and cumulant type expansions of general random variables on a filtered probability spaces. We establish a "broken exponential martingale" expansion that generalizes and unifies the exponentiation result of…

In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…

Given an ordered partition $\Pi =\{P_1,P_2, ...,P_t\}$ of the vertex set $V$ of a connected graph $G=(V,E)$, the \emph{partition representation} of a vertex $v\in V$ with respect to the partition $\Pi$ is the vector…

We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their position in the target space, with the SOS constraint that…

Treemaps have been widely applied to the visualization of hierarchical data. A treemap takes a weighted tree and visualizes its leaves in a nested planar geometric shape, with sub-regions partitioned such that each sub-region has an area…

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

Cannon, Floyd and Parry have studied the modulus of finite subdivision rules extensively. We investigate the properties of the modulus of subdivision rules with linear and exponential growth at every vertex, using barycentric subdivision…

We study chiral expansion at $m_\rho$-scale in framework of chiral constituent quark model. The lowest vector meson resonsances are treated as composited fields of constituent quarks. We illustrate that, at energy scale of $\rho$-meson…

We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…

We analyze and test using Fourier extensions that minimize a Hilbert space norm for the purpose of solving partial differential equations (PDEs) on surfaces. In particular, we prove that the approach is arbitrarily high-order and also show…

In this paper we present a new approach for tightening upper bounds on the partition function. Our upper bounds are based on fractional covering bounds on the entropy function, and result in a concave program to compute these bounds and a…

We analyze Kumar's recent quadratic algebraic branching program size lower bound proof method (CCC 2017) for the power sum polynomial. We present a refinement of this method that gives better bounds in some cases. The lower bound relies on…

This report discusses the improved bound of the cluster expansion, recently proposed by Procacci and Yuhjtman (Lett. Math. Phys. 107, 31, 2017). Brydges and Helmuth noticed the relevance of Kruskal's algorithm, which allows to streamline…

We present a field theoretic method for the calculation of the second and third virial coefficients b2 and b3 of 2-species fermions interacting via a contact interaction. The method is mostly analytic. We find a closed expression for b3 in…

Many hard algorithmic problems dealing with graphs, circuits, formulas and constraints admit polynomial-time upper bounds if the underlying graph has small treewidth. The same problems often encourage reducing the maximal degree of vertices…

We employ the $\Phi-$ derivable approach to many particle systems with strong correlations that can lead to the formation of bound states (clusters) of different size. We define a generic form of $\Phi-$ functionals that is fully equivalent…

This article provides numerical evidence that under volume constraint the ball is the set which maximizes the perimeter of the least-perimeter partition into cells with prescribed areas. We introduce a numerical maximization algorithm which…

Interface dynamics in two-dimensional systems with a maximal number of conservation laws gives an accurate theoretical model for many physical processes, from the hydrodynamics of immiscible, viscous flows (zero surface-tension limit of…

The Random Projection Tree structures proposed in [Freund-Dasgupta STOC08] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of data. We prove new results for both the RPTreeMax…

We introduce and study VERSs (vertex and edge replacement systems) as a technology of graph expansions. We consider its history graph, an augmented tree that records each graph expansion, and we provide sufficient conditions under which it…