Related papers: The Dual Majorizing Measure Theorem for Canonical …
We investigate the asymptotic growth of the canonical measures on the fibers of morphisms between vector spaces over local fields of arbitrary characteristic. For non-archimedean local fields we use a version of the {\L}ojasiewicz…
Uplift modeling is crucial in various applications ranging from marketing and policy-making to personalized recommendations. The main objective is to learn optimal treatment allocations for a heterogeneous population. A primary line of…
We propose an algorithm-independent framework to equip existing optimization methods with primal-dual certificates. Such certificates and corresponding rate of convergence guarantees are important for practitioners to diagnose progress, in…
We prove an apparently novel concentration of measure result for Markov tree processes. The bound we derive reduces to the known bounds for Markov processes when the tree is a chain, thus strictly generalizing the known Markov process…
Through certain appropriate constructions, we establish periodic solutions in distribution for some stochastic differential equations with infinite-dimensional Levy noise. Additionally, we obtain the corresponding periodic measures and…
In [Aldous,Pitman,1998] a tree-valued Markov chain is derived by pruning off more and more subtrees along the edges of a Galton-Watson tree. More recently, in [Abraham,Delmas,2012], a continuous analogue of the tree-valued pruning dynamics…
We prove a functional central limit theorem for partial sums of symmetric stationary long range dependent heavy tailed infinitely divisible processes with a certain type of negative dependence. Previously only positive dependence could be…
We consider the problem of computing the measure of a regular set of infinite binary trees. While the general case remains unsolved, we show that the measure of a language can be computed when the set is given in one of the following three…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
A practical version of the polynomial canonical formalism is developed for normal mesoscopic systems consisting of N independent electrons. Drastic simplification of calculations is attained by means of proper ordering excited states of the…
In a general $L^2$ extension theorem of Demailly for log canonical pairs, the $L^2$ criterion with respect to a measure called the Ohsawa measure determines when a given holomorphic function can be extended. Despite the analytic nature of…
We establish a new class of functional central limit theorems for partial sum of certain symmetric stationary infinitely divisible processes with regularly varying L\'{e}vy measures. The limit process is a new class of symmetric stable…
We present a new kind of Lagrangian duality theory for set-valued convex optimization problems whose objective and constraint maps are defined between preordered normed spaces. The theory is accomplished by introducing a new set-valued…
We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts…
DY Gao solely or together with some of his collaborators applied his Canonical duality theory (CDT) for solving a class of unconstrained optimization problems, getting the so-called "triality theorems". Unfortunately, the "double-min…
Dual-tree algorithms are a widely used class of branch-and-bound algorithms. Unfortunately, developing dual-tree algorithms for use with different trees and problems is often complex and burdensome. We introduce a four-part logical split:…
This paper presents a canonical dual approach for solving a nonconvex global optimization problem governed by a sum of fourth-order polynomial and a log-sum-exp function. Such a problem arises extensively in engineering and sciences. Based…
The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have definable Skolem functions (by a monadic formula with…
Monadic second order logic can be used to express many classical notions of sets of vertices of a graph as for instance: dominating sets, induced matchings, perfect codes, independent sets or irredundant sets. Bounds on the number of sets…
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we know: Any property of finite structures, which is expressible by…