Related papers: Some Results on Metric Trees

In this paper we present with algebraic trees a novel notion of (continuum) trees which generalizes countable graph-theoretic trees to (potentially) uncountable structures. For that purpose we focus on the tree structure given by the branch…

Let $(M,d)$ be a bounded countable metric space and $c>0$ a constant, such that $d(x,y)+d(y,z)-d(x,z) \ge c$, for any pairwise distinct points $x,y,z$ of $M$. For such metric spaces we prove that they can be isometrically embedded into any…

We first identify (up to linear isomorphism) the Lipschitz free spaces of quasiarcs. By decomposing quasiconformal trees into quasiarcs as done in an article of David, Eriksson-Bique, and Vellis, we then identify the Lipschitz free spaces…

In this paper the theory of uniformly convex metric spaces is developed. These spaces exhibit a generalized convexity of the metric from a fixed point. Using a (nearly) uniform convexity property a simple proof of reflexivity is presented…

The problem of realizing finite metric spaces in terms of weighted graphs has many applications. For example, the mathematical and computational properties of metrics that can be realized by trees have been well-studied and such research…

We show the existence of a compact metric space $K$ such that whenever $K$ embeds isometrically into a Banach space $Y$, then any separable Banach space is linearly isometric to a subspace of $Y$. We also address the following related…

Diamond graphs and binary trees are important examples in the theory of metric embeddings and also in the theory of metric characterizations of Banach spaces. Some results for these families of graphs are parallel to each other, for example…

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…

We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…

We consider the problem of isometric embedding of metric spaces to the Banach spaces; and introduce and study the remarkable class of so-called linearly rigid metric spaces: these are the spaces that admit a unique, up to isometry, linearly…

We consider the space of complete and separable metric spaces which are equipped with a probability measure. A notion of convergence is given based on the philosophy that a sequence of metric measure spaces converges if and only if all…

We combine conditions found in [Wh] with results from [MPR] to show that quasi-isometries between uniformly discrete bounded geometry spaces that satisfy linear isoperimetric inequalities are within bounded distance to bilipschitz…

It is well known that fixed point problems of contractive-type mappings defined on cone metric spaces over Banach algebras are not equivalent to those in usual metric spaces (see [3] and [10]). In this framework, the novelty of the present…

An infinite dimensional notion of asymptotic structure is considered. This notion is developed in terms of trees and branches on Banach spaces. Every countably infinite countably branching tree $\mathcal T$ of a certain type on a space X is…

The early development of a zygote can be mathematically described by a developmental tree. To compare developmental trees of different species, we need to define distances on trees. If children cells after a division are not…

We study topological properties of random metric spaces which arise by Lambda-coalescents. These are stochastic processes, which start with an infinite number of lines and evolve through multiple mergers in an exchangeable setting. We show…

Merge trees are a type of graph-based topological summary that tracks the evolution of connected components in the sublevel sets of scalar functions. They enjoy widespread applications in data analysis and scientific visualization. In this…

Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…

In the present paper we investigate the class of compact trees, endowed with the coarse wedge topology, in the area of non-separable Banach spaces. We describe Valdivia compact trees in terms of inner structures and we characterize the…

We introduce two ordinal indices that are linear invariants for Banach spaces: the dyadic tree index and the sprawling tree index. We show that they are also bi-Lipschitz invariants. In fact, we characterize their values in terms of…