Related papers: The Universal $\ell^p$-Metric on Merge Trees
We use weights on objects in an abelian category to define what we call a path metric. We introduce three special classes of weight: those compatible with short exact sequences; those induced by their path metric; and those which bound…
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.…
Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \emph{uniform temporal trees}. A uniform temporal tree is obtained by assigning independent uniform $[0,1]$ labels to the edges of a…
In ``Characterization, stability and convergence of hierarchical clustering methods'' by G. E. Carlsson, F. Memoli, the natural way to construct an ultrametric space from a given metric space was presented. It was shown that the…
Random measures provide flexible parameters for Bayesian nonparametric models. Given two different priors for a random measure, we develop a natural framework to investigate the rate at which the corresponding posteriors merge, as the…
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…
We analyze the interplay between labeled trees and the ultrametric spaces they present. We provide characterizations of labeled trees that generate separable ultrametric spaces and those that generate locally finite ultrametric spaces. In…
In \cite{FKW} Katznelson and Weiss establish that all sufficiently large distances can always be attained between pairs of points from any given measurable subset of $\mathbb{R}^2$ of positive upper (Banach) density. A second proof of this…
We give formulas for calculating the interleaving distance between rectangle persistence modules that depend solely on the geometry of the underlying rectangles. Moreover, we extend our results to calculate the bottleneck distance for…
We prove a Lipschitz extension lemma in which the extension procedure simultaneously preserves the Lipschitz continuity for two non-equivalent distances. The two distances under consideration are the Euclidean distance and, roughly…
We make progress on an interesting problem on the boundedness of maximal modulations of the Hilbert transform along the parabola. Namely, if we consider the multiplier arising from it and restrict it to lines, we prove uniform $L^p$ bounds…
Unimodality of the normalized coefficients of the characteristic polynomial of distance matrices of trees are known and bounds on the location of its peak (the largest coefficient) are also known. Recently, an extension of these results to…
In 2012, Pflug and Pichler proved, under regularity assumptions, that the value function in Multistage Stochastic Programming (MSP) is Lipschitz continuous w.r.t. the Nested Distance, which is a distance between scenario trees (or discrete…
We present a generalization of the induced matching theorem and use it to prove a generalization of the algebraic stability theorem for $\mathbb{R}$-indexed pointwise finite-dimensional persistence modules. Via numerous examples, we show…
The minimal number of rooted subtree prune and regraft (rSPR) operations needed to transform one phylogenetic tree into another one induces a metric on phylogenetic trees - the rSPR-distance. The rSPR-distance between two phylogenetic trees…
We provide upper bounds of the expected Wasserstein distance between a probability measure and its empirical version, generalizing recent results for finite dimensional Euclidean spaces and bounded functional spaces. Such a generalization…
It is known that PQ-symmetric maps on the boundary characterize the quasi-isometry type of visual hyperbolic spaces, in particular, of geodesically complete \br-trees. We define a map on pairs of PQ-symmetric ultrametric spaces which…
In the study of dynamical and physical systems, the input parameters are often uncertain or randomly distributed according to a measure $\varrho$. The system's response $f$ pushes forward $\varrho$ to a new measure $f\circ \varrho$ which we…
In this article we investigate the Uniform Spanning Forest ($\mathsf{USF}$) in the nearest-neighbour integer lattice $\mathbf{Z}^{d+1} = \mathbf{Z}\times \mathbf{Z}^d$ with an assignment of conductances that makes the underlying (Network)…
We introduce a distance in the space of fully-supported probability measures on one-dimensional symbolic spaces. We compare this distance to the $\bar{d}$-distance and we prove that in general they are not comparable. Our projective…