Related papers: Some Results on Metric Trees
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a graph which strongly preserves distances in the graph is a…
One of the most challenging problems in polymer physics is providing a theoretical description for the behaviour of rings in dense solutions and melts. Although it is nowadays well established that the overall size of a ring in these…
Let $\FN$ be a free group of finite rank $N \geq 2$, and let $T$ be an $\R$-tree with a very small, minimal action of $\FN$ with dense orbits. For any basis $\CA$ of $\FN$ there exists a {\em heart} $K_{\CA} \subset \bar T$ (= the metric…
In this paper we study the existence and uniqueness of best proximity points of cyclic contractions as well as the convergence of iterates to such proximity points. We do it from two different approaches, leading each one of them to…
Let $G=(V,E)$ be a connected graph and $d_{G}(u,v)$ be the shortest distance between the vertices $u$ and $v$ in $G$. A set $S=\{s_{1},s_{2},\cdots,s_{n}\}\subset V(G)$ is said to be a {\em resolving set} if for all distinct vertices $u,v$…
Fitting distances to tree metrics and ultrametrics are two widely used methods in hierarchical clustering, primarily explored within the context of numerical taxonomy. Given a positive distance function…
Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…
Ultrametric matrices have a rich structure that is not apparent from their definition. Notably, the subclass of strictly ultrametric matrices are covariance matrices of certain weighted rooted binary trees. In applications, these matrices…
Tree congruence metrics are typically global indices that describe the similarity or dissimilarity between dendrograms. This study principally focuses on topological congruence metrics that quantify similarity between two dendrograms and…
The main result of this paper is that the space of conformally compact Einstein metrics on a given manifold is a smooth, infinite dimensional Banach manifold, provided it is non-empty, generalizing earlier work of Graham-Lee and Biquard. We…
We study two graph parameters defined via tree decompositions: tree-independence number and induced matching treewidth. Both parameters are defined similarly as treewidth, but with respect to different measures of a tree decomposition…
Metric learning has the aim to improve classification accuracy by learning a distance measure which brings data points from the same class closer together and pushes data points from different classes further apart. Recent research has…
We define the concept of an ultrametric M\"obius space and use this to characterize nonelementary geodesically complete trees.
Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree $\tree$ where the weight of each node is the sum of the weights of its children. A treemap for $\tree$ is a hierarchical partition of a rectangle…
We study distorted metrics on binary trees in the context of phylogenetic reconstruction. Given a binary tree $T$ on $n$ leaves with a path metric $d$, consider the pairwise distances $\{d(u,v)\}$ between leaves. It is well known that these…
This paper is a detailled study of the coding of real trees by real valued functions that is motivated by probabilistic problems related to continuum random trees. Indeed it is known since the works of Aldous (1993) and Le Gall (1991) that…
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…
We discuss various aspects of a local-to-global embedding technique and the metric geometry of stable metric spaces and of two of its important subclasses: locally finite spaces and proper spaces. We explain how the barycentric gluing…
We develop a theory of large scale geometry of metrisable topological groups that, in a significant number of cases, allows one to define and identify a unique quasi-isometry type intrinsic to the topological group. Moreover, this…
Tree-level Feynman diagrams in a cubic scalar theory can be given a metric such that each edge has a length. The space of metric trees is made out of orthants joined where a tree degenerates. Here we restrict to planar trees since each…