Related papers: The Universal $\ell^p$-Metric on Merge Trees
We prove the existence of global minimizers to the double minimization problem \[ \inf\Big\{ P(E) + \lambda W_p(\mathcal{L}^n \lfloor \, E,\mathcal{L}^n \lfloor\, F) \colon |E \cap F| = 0, \, |E| = |F| = 1\Big\}, \] where $P(E)$ denotes the…
Combinatorial characterisations of minimal rigidity are obtained for symmetric 2-dimensional bar-joint frameworks with either $\ell^1$ or $\ell^\infty$ distance constraints. The characterisations are expressed in terms of symmetric tree…
Borel probability measures living on metric spaces are fundamental mathematical objects. There are several meaningful distance functions that make the collection of the probability measures living on a certain space a metric space. We are…
We study Erd\H os's distinct distances problem under $\ell_p$ metrics with integer $p$. We improve the current best bound for this problem from $\Omega(n^{4/5})$ to $\Omega(n^{6/7-\epsilon})$, for any $\epsilon>0$. We also characterize the…
The transportation $\mathrm{L}^p$ distance, denoted $\mathrm{TL}^p$, has been proposed as a generalisation of Wasserstein $\mathrm{W}^p$ distances motivated by the property that it can be applied directly to colour or multi-channelled…
Metric embedding is a powerful tool used extensively in mathematics and computer science. We devise a new method of using metric embeddings recursively, which turns out to be particularly effective in $\ell_p$ spaces, $p>2$, yielding…
Let $p\in[1,\infty]$ and $F:\mathbf{Set}\to\mathbf{Set}$ be a functor with finite supports in the category $\mathbf{Set}$ of sets. Given a non-empty metric space $(X,d_X)$, we introduce the distance $d^p_{FX}$ on the functor-space $FX$ as…
We propose a general framework for converting global and local similarities between biological sequences to quasi-metrics. In contrast to previous works, our formulation allows asymmetric distances, originating from uneven weighting of…
We study the Wasserstein metric $W_p$, a notion of distance between two probability distributions, from the perspective of Fourier Analysis and discuss applications. In particular, we bound the Earth Mover Distance $W_1$ between the…
In this work we define a metric structure to compare functions defined on different merge trees. The metric introduced possesses some stability properties, which we illustrate within a standard topological data analysis (TDA) framework, and…
We consider metrics which are preserved under a $p$-Wasserstein transport map, up to a possible contraction. In the case $p=1$ this corresponds to a metric which is uniformly curved in the sense of coarse Ricci curvature. We investigate the…
We prove an expanded range of $\ell ^{p}(\mathbb{Z}^d)$-improving properties and sparse bounds for discrete spherical maximal means in every dimension $d\geq 6$. Essential elements of the proofs are bounds for high exponent averages of…
In 2009, Chazal et al. introduced $\epsilon$-interleavings of persistence modules. $\epsilon$-interleavings induce a pseudometric $d_I$ on (isomorphism classes of) persistence modules, the interleaving distance. The definitions of…
Within the field of phylogenetics there is great interest in distance measures to quantify the dissimilarity of two trees. Here, based on an idea of Bruen and Bryant, we propose and analyze a new distance measure: the Maximum Parsimony (MP)…
We show that a constant-size constant-error coreset for polytope distance is simple to maintain under merges of coresets. However, increasing the size cannot improve the error bound significantly beyond that constant.
We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…
Persistent homology is a way of determining the topological properties of a data set. It is well known that each persistence module admits the structure of a representation of a finite totally ordered set. In previous work, the authors…
Merge trees, a type of topological descriptor, serve to identify and summarize the topological characteristics associated with scalar fields. They present a great potential for the analysis and visualization of time-varying data. First,…
Ultametrics are an important class of distances used in applications such as phylogenetics, clustering and classification theory. Ultrametrics are essentially distances that can be represented by an edge-weighted rooted tree so that all of…
Within the field of phylogenetics there is great interest in distance measures to quantify the dissimilarity of two trees. Recently, a new distance measure has been proposed: the Maximum Parsimony (MP) distance. This is based on the…