The Universal ℓ^p-Metric on Merge Trees

12/22/2021
by   Robert Cardona, et al.
0

Adapting a definition given by Bjerkevik and Lesnick for multiparameter persistence modules, we introduce an ℓ^p-type extension of the interleaving distance on merge trees. We show that our distance is a metric, and that it upper-bounds the p-Wasserstein distance between the associated barcodes. For each p∈[1,∞], we prove that this distance is stable with respect to cellular sublevel filtrations and that it is the universal (i.e., largest) distance satisfying this stability property. In the p=∞ case, this gives a novel proof of universality for the interleaving distance on merge trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/25/2021

ℓ^p-Distances on Multiparameter Persistence Modules

Motivated both by theoretical and practical considerations in topologica...
research
02/28/2018

The ℓ^∞-Cophenetic Metric for Phylogenetic Trees as an Interleaving Distance

There are many metrics available to compare phylogenetic trees since thi...
research
04/22/2020

Frechet-Like Distances between Two Merge Trees

The purpose of this paper is to extend the definition of Frechet distanc...
research
12/03/2022

The DOPE Distance is SIC: A Stable, Informative, and Computable Metric on Time Series And Ordered Merge Trees

Metrics for merge trees that are simultaneously stable, informative, and...
research
01/15/2018

Strategies for Stable Merge Sorting

We introduce new stable, natural merge sort algorithms, called 2-merge s...
research
06/21/2015

Beyond Hartigan Consistency: Merge Distortion Metric for Hierarchical Clustering

Hierarchical clustering is a popular method for analyzing data which ass...
research
10/16/2022

Computing a Stable Distance on Merge Trees

Distances on merge trees facilitate visual comparison of collections of ...

Please sign up or login with your details

Forgot password? Click here to reset