Related papers: Tree metrics and their Lipschitz-free spaces

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…

We prove that the Lipschitz-free space over any uniformly discrete metric space has the 3-Schur property

We introduce and study a natural notion of probabilistic 1-Lipschitz maps. We prove that the space of all probabilistic 1-Lipschitz maps defined on a probabilistic metric space G is also a probabilistic metric space. Moreover, when G is a…

We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.

Given a metric space with a Borel probability measure, for each integer $N$ we obtain a probability distribution on $N\times N$ distance matrices by considering the distances between pairs of points in a sample consisting of $N$ points…

Associated to any finite metric space are a large number of objects and quantities which provide some degree of structural or geometric information about the space. In this paper we show that in the setting of subsets of weighted Hamming…

We construct a family of purely PI unrectifiable Lipschitz differentiability spaces and investigate the possible of Banach spaces targets for which Lipschitz differentiability holds. We provide a general investigation into the geometry of…

We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its…

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…

We propose a general scheme for studying separably reducible properties in metric spaces and then apply it to obtain separable determinacy of Lipschitz property and the separable determinacy of slopes

We conjecture that whenever $M$ is a metric space of density at most continuum, then the space of Lipschitz functions is $w^*$-separable. We prove the conjecture for several classes of metric spaces including all the Banach spaces with a…

This paper initiates the study of the structure of a new class of $p$-Banach spaces, $0<p<1$, namely the Lipschitz free $p$-spaces (alternatively called Arens-Eells $p$-spaces) $\mathcal{F}_{p}(\mathcal{M})$ over $p$-metric spaces. We…

In this article, we characterize the bounded and the compact multiplication operators between distinct iterated logarithmic Lipschitz spaces, and between the Lipschitz space and an iterated logarithmic Lipschitz space of an infinite tree.…

We consider two questions on the geometry of Lipschitz free $p$-spaces $\mathcal F_p$, where $0<p\leq 1$, over subsets of finite-dimensional vector spaces. We solve an open problem and show that if $(\mathcal M, \rho)$ is an infinite…

We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicity) and so the values of two consecutive points do not increase by too…

We define and give explicit construction of the universal tree-graded space with a given collection of pieces. We apply that to proving uniqueness of asymptotic cones of relatively hyperbolic groups whose peripheral subgroups have unique…

We study the metric properties of finite subsets of L_1. The analysis of such metrics is central to a number of important algorithmic problems involving the cut structure of weighted graphs, including the Sparsest Cut Problem, one of the…

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…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

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…