Related papers: Some Results on Metric Trees
A metric space M is homogeneous if every isometry between finite subsets extends to a surjective isometry defined on the whole space. We show that if M is an ultrametric space, it suffices that isometries defined on singletons extend, i.e…
A {\em tree cover} of a metric space $(X,d)$ is a collection of trees, so that every pair $x,y\in X$ has a low distortion path in one of the trees. If it has the stronger property that every point $x\in X$ has a single tree with low…
In this paper, the concept of the metric matrix is introduced to establish a concise and unified formulation for the inner product in barycentric coordinates. Building on this framework, we explore the intrinsic algebraic identities of…
We present and study a family of metrics on the space of compact subsets of $R^N$ (that we call ``shapes''). These metrics are ``geometric'', that is, they are independent of rotation and translation; and these metrics enjoy many…
Tree ring widths are an important source of climatic and historical data, but measuring these widths typically requires extensive manual work. Computer vision techniques provide promising directions towards the automation of tree ring…
The tight-span of a finite metric space is a polytopal complex that has appeared in several areas of mathematics. In this paper we determine the polytopal structure of the tight-span of a totally split decomposable (finite) metric. Totally…
In this note, we study the geometry of the unit ball of the Banach space generated by the adequate family of all subsets of branches of the infinite binary tree, and answer several open questions related to slicely countably determined…
Optimal transport provides a metric which quantifies the dissimilarity between probability measures. For measures supported in discrete metric spaces, finding the optimal transport distance has cubic time complexity in the size of the…
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…
Phylogenetic trees are a central tool in understanding evolution. They are typically inferred from sequence data, and capture evolutionary relationships through time. It is essential to be able to compare trees from different data sources…
There is a well-known correspondence between infinite trees and ultrametric spaces which can be interpreted as an equivalence of categories and comes from considering the end space of the tree. In this equivalence, uniformly continuous maps…
We introduce and study a variant of the Wasserstein distance on the space of probability measures, specially designed to deal with measures whose support has a dendritic, or treelike structure with a particular direction of orientation. Our…
In this paper, we study metric trees, without any finiteness restrictions. For subsets of such trees, a condition that guarantees that the Hausdorff and Gromov--Hausdorff distances from the subset to the entire metric tree are the same is…
Recent years have witnessed a surge of biological interest in the minimum spanning tree (MST) problem for its relevance to automatic model construction using the distances between data points. Despite the increasing use of MST algorithms…
This paper presents a unified computational framework for the estimation of distances, geodesics and barycenters of merge trees. We extend recent work on the edit distance [106] and introduce a new metric, called the Wasserstein distance…
For a metric compact space $L$ and a Banach space $E$, we provide a characterization of the complementability of the Banach space $\mathcal{C}(L)$ of continuous functions on $L$ inside $E$ in terms of the existence of a certain tree in the…
We study tree metrics that can be realized as a mixture of two star tree metrics. We prove that the only trees admitting such a decomposition are the ones coming from a tree with at most one internal edge, and whose weight satisfies certain…
We define, analyze, and give efficient algorithms for two kinds of distance measures for rooted and unrooted phylogenies. For rooted trees, our measures are based on the topologies the input trees induce on triplets; that is, on…
Merge trees, a type of topological descriptor, serve to identify and summarize the topological characteristics associated with scalar fields. They present a great potential for the analysis and visualization of time-varying data. First,…
Ultrametric trees are trees whose leaves lie at the same distance from the root. They are used to model the genealogy of a population of particles co-existing at the same point in time. We show how the boundary of an ultrametric tree, like…