Universality of the Bottleneck Distance for Extended Persistence Diagrams

07/03/2020
by   Ulrich Bauer, et al.
0

The extended persistence diagram is an invariant of piecewise linear functions, introduced by Cohen-Steiner, Edelsbrunner, and Harer. The bottleneck distance has been introduced by the same authors as an extended pseudometric on the set of extended persistence diagrams, which is stable under perturbations of the function. We address the question whether the bottleneck distance is the largest possible stable distance, providing an affirmative answer.

READ FULL TEXT

page 14

page 15

research
12/03/2020

Sketching Persistence Diagrams

Given a persistence diagram with n points, we give an algorithm that pro...
research
05/30/2022

Relative Interlevel Set Cohomology Categorifies Extended Persistence Diagrams

The extended persistence diagram introduced by Cohen-Steiner, Edelsbrunn...
research
05/26/2019

Geodesics in persistence diagram space

It is known that for a variety of choices of metrics, including the stan...
research
05/06/2015

Comparing persistence diagrams through complex vectors

The natural pseudo-distance of spaces endowed with filtering functions i...
research
07/09/2021

Realizable piecewise linear paths of persistence diagrams with Reeb graphs

Reeb graphs are widely used in a range of fields for the purposes of ana...
research
10/14/2020

Edit Distance and Persistence Diagrams Over Lattices

We build a functorial pipeline for persistent homology. The input to thi...
research
03/03/2022

Reconstruction of univariate functions from directional persistence diagrams

We describe a method for approximating a single-variable function f usin...

Please sign up or login with your details

Forgot password? Click here to reset