A. G. Aksoy, B. Maurizi
In this paper we examine the relationship between hyperconvex hulls and metric trees. After providing a linking construction for hyperconvex spaces, we show that the four-point property is inherited by the hyperconvex hull, which leads to the theorem that every complete metric tree is hyperconvex. We also consider some extension theorems for these spaces.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The tight span, or injective envelope, is an elegant and useful construction that takes a metric space and returns the smallest hyperconvex space into which it can be embedded. The concept has stimulated a large body of theory and has applications to metric classification and data visualisation. Here we introduce a generalisation of metrics, called diversities, and demonstrate that the rich theory associated to metric tight spans and hyperconvexity extends to a seemingly richer theory of diversity tight spans and hyperconvexity.
Diversities have been recently introduced as a generalization of metrics for which a rich tight span theory could be stated. In this work we take up a number of questions about hyperconvexity, diversities and fixed points of nonexpansive mappings. Most of these questions are motivated by the study of the connection between a hyperconvex diversity and its induced metric space for which we provide some answers. Examples are given, for instance, showing that such a metric space need not be hyperconvex but still we prove, as our main result, that they enjoy the fixed point property for nonexpansiv…
We show that in complete metric spaces, $4$-hyperconvexity is equivalent to finite hyperconvexity. Moreover, every complete, almost $n$-hyperconvex metric space is $n$-hyperconvex. This generalizes among others results of Lindenstrauss and answers questions of Aronszajn-Panitchpakdi. Furthermore, we prove local-to-global results for externally and weakly externally hyperconvex subsets of hyperconvex metric spaces and find sufficient conditions in order for those classes of subsets to be convex with respect to a geodesic bicombing.
Inspired by the concept of hyperconvexity and its relation to curvature, we translate geometric properties of a metric space encoded by the curvature inequalities into the persistent homology induced by the Čech filtration of that space.
Diversities have recently been developed as multiway metrics admitting clear and useful notions of hyperconvexity and tight span. In this note we consider the analytic properties of diversities, in particular the generalizations of uniform continuity, uniform convergence, Cauchy sequences and completeness to diversities. We develop conformities, a diversity analogue of uniform spaces, which abstract these concepts in the metric case. We show that much of the theory of uniform spaces admits a natural analogue in this new structure; for example, conformities can be defined either axiomatically o…
We compute the Lipschitz-free spaces of subsets of the real line and characterize subsets of metric trees by the fact that their Lipschitz-free space is isometric to a subspace of $L_1$.
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 some fundamental properties of metric trees and metric segments, we will give a characterization of compact metric trees in terms of metric segments. Two common measures of noncompactness are the ball and set measures, respectively defined as \[ β(S) = \inf \{ε\mid S {has a finite} ε{-net in} M\} {and} \] \[ α(S) = \inf\{ε\mid S {has a finite cover of sets of d…
Finite metric trees are known to have strict 1-negative type. In this paper we introduce a new family of inequalities that quantify the extent of the "strictness" of the 1-negative type inequalities for finite metric trees. These inequalities of "enhanced 1-negative type" are sufficiently strong to imply that any given finite metric tree must have strict p-negative type for all values of p in an open interval that contains the number 1. Moreover, these open intervals can be characterized purely in terms of the unordered distribution of edge weights that determine the path metric on the particu…
On metric characterizations of tree and fragmentability indices of Banach spaces
本文引入两个序数指标（二叉树指标和蔓延树指标）作为Banach空间的线性不变量，证明它们也是双Lipschitz不变量，并通过序数高度的二叉或可数分支钻石图的子Lipschitz嵌入性刻画其值，进而应用于完备可分度量空间和双Lipschitz嵌入的泛函Banach空间，并讨论这些树指标与经典的可碎片化指标（如齿形性、弱可碎片化和Szlenk指标）的联系。
We show that an infinite weighted tree admits a bi-Lipschitz embedding into Hilbert space if and only if it does not contain arbitrarily large complete binary trees with uniformly bounded distortion. We also introduce a new metric invariant called Markov convexity, and show how it can be used to compute the Euclidean distortion of any metric tree up to universal factors.
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 Banach spaces in terms of uniforms embeddings of the finite trees. A characterization of the linear type for Banach spaces is given using the embedding of the infinite tree equipped with a suitable metric.
Using isometric embedding of metric trees into Banach spaces, this paper will investigate barycenters, type and cotype, and various measures of compactness of metric trees. A metric tree ($T$, $d$) is a metric space such that between any two of its points there is an unique arc that is isometric to an interval in $\mathbb{R}$. We begin our investigation by examining isometric embeddings of metric trees into Banach spaces. We then investigate the possible images $x_0=π((x_1+\ldots+x_n)/n)$, where $π$ is a contractive retraction from the ambient Banach space $X$ onto $T$ (such a $π$ always exist…
Gromov-Hausdorff Geometry of Metric Trees
本文研究无有限性限制的度量树，得出了保证子集到整个树的Hausdorff距离与Gromov--Hausdorff距离相等的条件，并据此在所有度量空间的真类中构造出连接该子集与树本身的新一类最短测地线。
We study the Wasserstein (or earthmover) metric on the space $P(X)$ of probability measures on a metric space $X$. We show that, if a finite metric space $X$ embeds stochastically with distortion $D$ in a family of finite metric trees, then $P(X)$ embeds bi-Lipschitz into $\ell^1$ with distortion $D$. Next, we re-visit the closed formula for the Wasserstein metric on finite metric trees due to Evans-Matsen \cite{EvMat}. We advocate that the right framework for this formula is real trees, and we give two proofs of extensions of this formula: one making the link with Lipschitz-free spaces from B…
In this note, we prove optimal extension results for roughly isometric relations between metric (R-)trees and injective metric spaces. This yields sharp stability estimates, in terms of the Gromov-Hausdorff (GH) distance, for certain metric spanning constructions: The GH distance of two metric trees spanned by some subsets is smaller than or equal to the GH distance of these sets. The GH distance of the injective hulls, or tight spans, of two metric spaces is at most twice the GH distance between themselves.
In this paper we prove the equivalence of definitions for metric trees and for δ-hyperbolic spaces. We point out how these equivalences can be used to understand the geometric and metric properties of δ-hyperbolic spaces and its relation to CAT(κ) spaces.
We investigate isometric embeddings of finite metric trees into $(\mathbb{R}^n,d_{1})$ and $( \mathbb{R}^n, d_{\infty})$. We prove that a finite metric tree can be isometrically embedded into $(\mathbb{R}^n,d_{1})$ if and only if the number of its leaves is at most $2n$. We show that a finite star tree with at most $2^n$ leaves can be isometrically embedded into $(\mathbb{R}^{n}, d_{\infty})$ and a finite metric tree with more than $2^n$ leaves cannot be isometrically embedded into $(\mathbb{R}^{n}, d_{\infty})$. We conjecture that an arbitrary finite metric tree with at most $2^n$ leaves can …
We introduce the notion of metric semilattice on the metric space and prove the criterion of $\R$-tree as connected geodesic metric space $X$ admitting the partial order, such that $X$ is semilinear metric semilattice. Also we state the homeomorphism between topological space of orders defining upper semilinear metric $\vee$-semilattices on locally compact complete $\mathbb R$-tree $X$ and its metric compactification $\bar{X}_m$. As an application we construct the example of locally complete non-homogeneous similarity-homogeneous space showing essentiality of the condition of locally compactne…
Using the wedge sum of metric spaces, for all compact metrizable spaces, we construct a topological embedding of the compact metrizable space into the set of all metric trees in the Gromov--Hausdorff space with finite prescribed values. As its application, we show that the set of all metric trees is path-connected and its all non-empty open subsets have infinite topological dimension.
We provide a new representation of an $\mathbb R$-tree by using a special set of metric rays. We have captured the four-point condition from these metric rays and shown an equivalence between the $\mathbb R$-trees with radial and river metrics, and these sets of metric rays. In stochastic analysis, these graphical representation theorems are of particular interest in identifying Brownian motions indexed by $\mathbb R$-trees.
The definition of $n$-width of a bounded subset $A$ in a normed linear space $X$ is based on the existence of $n$-dimensional subspaces. Although the concept of an $n$-dimensional subspace is not available for metric trees, in this paper, using the properties of convex and compact subsets, we present a notion of $n$-widths for a metric tree, called T$n$-widths. Later we discuss properties of T$n$-widths, and show that the compact width is attained. A relationship between the compact widths and T$n$-widths is also obtained.
Beyond trees: the metric geometry of subsets of weighted Hamming cubes
本文研究加权汉明立方体子集的度量几何，揭示其关联几何量间的意外关系，推导距离矩阵行列式等公式，拓展此前的树与标准汉明立方体相关结果，并刻画其中的非平凡1-多边形等式。
A Combination Theorem for Trees of Metric Bundles
本文定义度量丛之树，统一度量空间之树与度量丛，并在纤维双曲、重心映射粗满射、边空间拟等距嵌入及 Bestvina-Feighn 走廊扩张条件下证明其全空间双曲，进而给出有限单纯复形上群复形的组合定理。
We present a new class of metrics for unrooted phylogenetic $X$-trees derived from the Gromov-Hausdorff distance for (compact) metric spaces. These metrics can be efficiently computed by linear or quadratic programming. They are robust under NNI-operations, too. The local behavior of the metrics shows that they are different from any formerly introduced metrics. The performance of the metrics is briefly analised on random weighted and unweighted trees as well as random caterpillars.
In a recent paper Chatterji and Niblo proved that a geodesic metric space is Gromov hyperbolic if and only if the intersection of any two closed balls has uniformly bounded eccentricity. In their paper, the authors raise the question whether a geodesic metric space with the property that the intersection of any two closed balls has eccentricity 0, is necessarily a real tree. The purpose of this note is to answer this question affirmatively. We also partially improve the main result of Chatterji and Niblo by showing that already sublinear eccentricity implies Gromov hyperbolicity.
A well known result in the analysis of finite metric spaces due to Gromov says that given any $(X,d_X)$ there exists a \emph{tree metric} $t_X$ on $X$ such that $\|d_X-t_X\|_\infty$ is bounded above by twice $\mathrm{hyp}(X)\cdot \log(2\,|X|)$. Here $\mathrm{hyp}(X)$ is the \emph{hyperbolicity} of $X$, a quantity that measures the \emph{treeness} of $4$-tuples of points in $X$. This bound is known to be asymptotically tight. We improve this bound by restricting ourselves to metric spaces arising from filtered posets. By doing so we are able to replace the cardinality appearing in Gromov's boun…
We investigate connections between potential theories on a Ahlfors-regular metric space X, on a graph G associated with X, and on the tree T obtained by removing the "horizontal edges" in G. Applications to the calculation of set capacity are given.
We consider metrical task systems on tree metrics, and present an $O(\mathrm{depth} \times \log n)$-competitive randomized algorithm based on the mirror descent framework introduced in our prior work on the $k$-server problem. For the special case of hierarchically separated trees (HSTs), we use mirror descent to refine the standard approach based on gluing unfair metrical task systems. This yields an $O(\log n)$-competitive algorithm for HSTs, thus removing an extraneous $\log\log n$ in the bound of Fiat and Mendel (2003). Combined with well-known HST embedding theorems, this also gives an $O…
Given a Lipschitz map $f$ from a cube into a metric space, we find several equivalent conditions for $f$ to have a Lipschitz factorization through a metric tree. As an application we prove a recent conjecture of David and Schul. The techniques developed for the proof of the factorization result yield several other new and seemingly unrelated results. We prove that if $f$ is a Lipschitz mapping from an open set in $\mathbb{R}^n$ onto a metric space $X$, then the topological dimension of $X$ equals $n$ if and only if $X$ has positive $n$-dimensional Hausdorff measure. We also prove an area formu…
In every dimension $n\ge 3$ we introduce a class of orthogonal graph-manifolds and prove that the fundamental group of any orthogonal graph-manifold quasi-isometrically embeds into a product of $n$ trees. As a consequence, we obtain that asymptotic and linearly-controlled asymptotic dimensions of such group are equal to $n$.
We attempt to shed new light on the notion of 'tree-like' metric spaces by focusing on an approach that does not use the four-point condition. Our key question is: Given metric space $M$ on $n$ points, when does a fully labelled positive-weighted tree $T$ exist on the same $n$ vertices that precisely realises $M$ using its shortest path metric? We prove that if a spanning tree representation, $T$, of $M$ exists, then it is isomorphic to the unique minimum spanning tree in the weighted complete graph associated with $M$, and we introduce a fourth-point condition that is necessary and sufficient…
Given data, finding a faithful low-dimensional hyperbolic embedding of the data is a key method by which we can extract hierarchical information or learn representative geometric features of the data. In this paper, we explore a new method for learning hyperbolic representations by taking a metric-first approach. Rather than determining the low-dimensional hyperbolic embedding directly, we learn a tree structure on the data. This tree structure can then be used directly to extract hierarchical information, embedded into a hyperbolic manifold using Sarkar's construction \cite{sarkar}, or used a…
In this paper, we present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding a graph metric into a tree metric (thus improving and simplifying the factor 100 and 27 algorithms of Bǎdoiu, Indyk, and Sidiropoulos (2007) and Bǎdoiu, Demaine, Hajiaghayi, Sidiropoulos, and Zadimoghaddam (2008)). We also present a constant factor algorithm for approximating the optimal distortion of embedding a graph metric into an outerplanar metric. For this, we introduce a general notion of metric relaxed minor and show that if G contains an alpha-metric relaxed H-min…
Bestvina metric and tree reduction for $K(π,1)$-conjecture
本文通过构造Artin群在Bestvina复形上的作用，将$K(π,1)$猜想简化为Coxeter图为树的Artin群性质，推导出新的满足该猜想的Artin群类别。
We show that for each n\ge 2 there is a quasi-isometric embedding of the hyperbolic space H^n in the product T^n=Tx...xT of n copies of a (simplicial) metric tree T. On the other hand, we prove that there is no quasi-isometric embedding H^2 --> TxR^m for any metric tree T and any m\ge 0.
In order to develop statistical methods for shapes with a tree-structure, we construct a shape space framework for tree-like shapes and study metrics on the shape space. This shape space has singularities, corresponding to topological transitions in the represented trees. We study two closely related metrics on the shape space, TED and QED. QED is a quotient Euclidean distance arising naturally from the shape space formulation, while TED is the classical tree edit distance. Using Gromov's metric geometry we gain new insight into the geometries defined by TED and QED. We show that the new metri…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。