Related papers: Tree metrics and their Lipschitz-free spaces
A metric phylogenetic tree relating a collection of taxa induces weighted rooted triples and weighted quartets for all subsets of three and four taxa, respectively. New intertaxon distances are defined that can be calculated from these…
A metric space is indivisible if for any partition of it into finitely many pieces one piece contains an isometric copy of the whole space. Continuing our investigation of indivisible metric spaces, we show that a countable ultrametric…
We show that under minimal assumptions, the intrinsic metric induced by a strongly local Dirichlet form induces a length space. A main input is a dual characterization of length spaces in terms of the property that the 1-Lipschitz functions…
We prove that if a metric space $X$ has Nagata dimension zero with constant $c$, then there exists a dense subset of $X$ that is $8c$-bilipschitz equivalent to a weighted tree. The factor $8$ is the best possible if $c=1$, that is, if $X$…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
We survey recent progress on three relevant instances of free objects related to Banach spaces: Lipschitz free spaces generated by metric spaces, holomorphic free spaces generated by open sets and free Banach lattices generated by Banach…
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively studied k-server problem. The proof is based on Ramsey-type…
There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…
In a 2013 paper, Cheeger and Kleiner introduced a new type of dimension for metric spaces, the "Lipschitz dimension". We study the dimension-theoretic properties of Lipschitz dimension, including its behavior under Gromov-Hausdorff…
We provide explicit upper bounds for the eigenvalues of the Laplacian on a finite metric tree subject to standard vertex conditions. The results include estimates depending on the average length of the edges or the diameter. In particular,…
Using methods from nonstandard analysis, we will discuss which metric spaces can be realized as asymptotic cones. Applying the results we will find in the context of groups, we will prove that a group with "a few" separable asymptotic cones…
This paper studies Minimum Spanning Trees under incomplete information for its vertices. We assume that no information is available on the precise placement of vertices so that it is only known that vertices belong to some neighborhoods…
On a non-compact, smooth, connected, boundaryless, complete Riemannian manifold $(M,g)$, one can define its ideal boundary by rays (or equivalently, Busemann functions). From the viewpoint of Mather theory, boundary elements could be…
We first consider interval partitions whose complements are Lebesgue-null and introduce a complete metric that induces the same topology as the Hausdorff distance (between complements). This is done using correspondences between intervals.…
A $\Lambda$-tree is a $\Lambda$-metric space satisfying three axioms (1), (2) and (3). We give a characterization of those ordered abelian groups $\Lambda$ for which axioms (1) and (2) imply axiom (3). As a special case, it follows that for…
The reliability of a phylogenetic inference method from genomic sequence data is ensured by its statistical consistency. Bayesian inference methods produce a sample of phylogenetic trees from the posterior distribution given sequence data.…
We define the matching measure of a lattice L as the spectral measure of the tree of self-avoiding walks in L. We connect this invariant to the monomer-dimer partition function of a sequence of finite graphs converging to L. This allows us…
We prove the equivalence of two seemingly very different ways of generalising Rademacher's theorem to metric measure spaces. One such generalisation is based upon the notion of forming partial derivatives along a very rich structure of…
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 present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a byproduct, we obtain evidence in favor of a new…