Related papers: Trees and Markov convexity

We compute the Markov convexity invariant of the continuous infinite dimensional Heisenberg group $\mathbb{H}_\infty$ to show that it is Markov 4-convex and cannot be Markov $p$-convex for any $p < 4$. As Markov convexity is a biLipschitz…

For every $p\in(0,\infty)$, a new metric invariant called umbel $p$-convexity is introduced. The asymptotic notion of umbel convexity captures the geometry of countably branching trees, much in the same way as Markov convexity, the local…

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…

It is shown that a Banach space admits an equivalent norm whose modulus of uniform convexity has power-type p if and only if it is Markov p-convex. Counterexamples are constructed to natural questions related to isomorphic uniform convexity…

We study a new bi-Lipschitz invariant \lambda(M) of a metric space M; its finiteness means that Lipschitz functions on an arbitrary subset of M can be linearly extended to functions on M whose Lipschitz constants are enlarged by a factor…

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…

We show that for a metric space with an even number of points there is a 1-Lipschitz map to a tree-like space with the same matching number. This result gives the first basic version of an unoriented Kantorovich duality. The study of the…

Motivated by the local theory of Banach spaces we introduce a notion of finite representability for metric spaces. This allows us to develop a new technique for comparing the generalized roundness of metric spaces. We illustrate this…

An ultrametric Cantor set can be seen as the boundary of a rooted weighted tree called the Michon tree. The notion of Assouad dimension is re-interpreted as seen on the Michon tree. The Assouad dimension of an ultrametric Cantor set is…

A well-known theorem of Assouad states that metric spaces satisfying the doubling property can be snowflaked and bi-Lipschitz embedded into Euclidean spaces. Due to the invariance of many geometric properties under bi-Lipschitz maps, this…

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…

For two metric spaces X and Y, say that X {threshold-embeds} into Y if there exist a number K > 0 and a family of Lipschitz maps $f_{\tau} : X \to Y : \tau > 0 \}$ such that for every $x,y \in X$, \[ d_X(x,y) \geq \tau =>…

We consider a class of infinite weighted metric trees obtained as perturbations of self-similar regular trees. Possible definitions of the boundary traces of functions in the Sobolev space on such a structure are discussed by using…

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 give a short and elementary proof of the fact that every metric space of finite asymptotic dimension can be embedded into a finite product of trees.

We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We…

We give a sufficient condition for a projective metric on a subset of a Euclidean space to admit a bi-Lipschitz embedding into Euclidean space of the same dimension.

A quasiconformal tree is a doubling metric tree in which the diameter of each arc is bounded above by a fixed multiple of the distance between its endpoints. We study the geometry of these trees in two directions. First, we construct a…

The purpose of this article is to show how the isotropy subgroup of leaf permutations on binary trees can be used to systematically identify tree-informative invariants relevant to models of phylogenetic evolution. In the quartet case, we…

We compute the magnitude (an isometric invariant of metric spaces) of compact $\mathbb{R}$-trees and show that it equals $1 + L/2$, where $L \in [0, \infty]$ denotes the total length. Although length is the only geometric invariant captured…