pith. sign in

arxiv: 1707.06288 · v3 · pith:A4AKURWEnew · submitted 2017-07-19 · 🧮 math.CT · math.AT

Interleaving and Gromov-Hausdorff distance

classification 🧮 math.CT math.AT
keywords distanceinterleavingdefineequivalencesgeometrygromov-hausdorffnotionsapplication
0
0 comments X
read the original abstract

One of the central notions to emerge from the study of persistent homology is that of interleaving distance. It has found recent applications in symplectic and contact geometry, sheaf theory, computational geometry, and phylogenetics. Here we present a general study of this topic. We define interleaving of functors with common codomain as solutions to an extension problem. In order to define interleaving distance in this setting we are led to categorical generalizations of Hausdorff distance, Gromov-Hausdorff distance, and the space of metric spaces. We obtain comparisons with previous notions of interleaving via the study of future equivalences. As an application we recover a definition of shift equivalences of discrete dynamical systems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Interleaving Distance as a Galois-Edit Distance

    math.AT 2025-09 unverdicted novelty 7.0

    Interleaving distance on single- and multi-parameter persistence modules equals a Galois-edit distance, yielding a new proof of bottleneck stability.