Related papers: Trees and Markov convexity
For a weighted tree, the Lin--Lu--Yau Ricci curvature admits an explicit formula in terms of the edge weights. Consequently, the constant-curvature equation is equivalent to an eigenvalue problem for an edge-indexed Ricci matrix $R_T$.…
We study representations of data from an arbitrary metric space $\mathcal{X}$ in the space of univariate Gaussian mixtures with a transport metric (Delon and Desolneux 2020). We derive embedding guarantees for feature maps implemented by…
The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding…
This paper investigates two involutions on binary trees. One is the mirror symmetry of binary trees which combined with the classical bijection $\varphi$ between binary trees and plane trees answers an open problem posed by Bai and Chen.…
We develop the theory of categories of measurable fields of Hilbert spaces and bounded fields of bounded operators. We examine classes of functors and natural transformations with good measure theoretic properties, providing in the end a…
We introduce a new class of lower bounds on the log partition function of a Markov random field which makes use of a reversed Jensen's inequality. In particular, our method approximates the intractable distribution using a linear…
We prove that a Banach space X is not super-reflexive if and only if the hyperbolic infinite tree embeds metrically into X. We improve one implication of J.Bourgain's result who gave a metrical characterization of super-reflexivity in…
In this article the authors continue the discussion in \cite{ALM} about inverse problems for second order elliptic and hyperbolic equations on metric trees from boundary measurements. In the present paper we prove the identifiability of…
The Erd\H{o}s similarity conjecture asserted that an infinite set of real numbers cannot be affinely embedded into every measurable set of positive Lebesgue measure. The problem is still open, in particular for all fast decaying sequences.…
We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…
Trees are very agreeable objects to work with, offering a diversity of behaviour within a structure that is sufficiently simple to admit precise analysis. Thus we are able to offer fairly satisfactory necessary and sufficient conditions on…
A metric tree ($M$, $d$), also known as $\mathbb{R}$-trees or $T$-theory, is a metric space such that between any two points there is an unique arc and that arc is isometric to an interval in $\mathbb{R}$. In this paper after presenting…
We study a configuration model on bipartite planar maps in which, given $n$ even integers, one samples a planar map with $n$ faces uniformly at random with these face degrees. We prove that when suitably rescaled, such maps always admit…
Relying on the notions of submodular function and partial metric, we introduce normed inverse semigroups as a generalization of normed groups and sup-semilattices equipped with an upper valuation. We define the property of skew-convexity…
The aim of this paper is to study ultralimits of pointed metric measure spaces (possibly unbounded and having infinite mass). We prove that ultralimits exist under mild assumptions and are consistent with the pointed measured…
Hilbert-Efimov theorem states that any complete surface with curvature bounded above by a negative constant can not be isometrically imbedded in $\mathbb{R}^3.$ We demonstrate that any simply-connected smooth complete surface with curvature…
Probabilistic metric embedding into trees is a powerful technique for designing online algorithms. The standard approach is to embed the entire underlying metric into a tree metric and then solve the problem on the latter. The overhead in…
We say that a finite metric space $X$ can be embedded almost isometrically into a class of metric spaces $C$, if for every $\epsilon > 0$ there exists an embedding of $X$ into one of the elements of $C$ with the bi-Lipschitz distortion less…
Several hook summation formulae for binary trees have appeared recently in the literature. In this paper we present an analogous formula for unordered increasing trees of size r, which involves r parameters. The right-hand side can be…
Diversities are an extension of the concept of a metric space which assign a non-negative value to every finite set of points, rather than just pairs. A general theory of diversities has been developed which exhibits many deep analogies to…