The reflection distance between zigzag persistence modules

05/28/2018
by   Alexander Elchesen, et al.
0

By invoking the reflection functors introduced by Bernstein, Gelfand, and Ponomarev in 1973, in this paper we define a metric on the space of all zigzag modules of a given length, which we call the reflection distance. We show that the reflection distance between two given zigzag modules of the same length is an upper bound for the ℓ^p-bottleneck distance between their respective persistence diagrams.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2019

Universality of persistence diagrams and the bottleneck and Wasserstein distances

We undertake a formal study of persistence diagrams and their metrics. W...
research
03/07/2018

Computing Bottleneck Distance for 2-D Interval Decomposable Modules

Computation of the interleaving distance between persistence modules is ...
research
08/17/2021

Rectangular Approximation and Stability of 2-parameter Persistence Modules

One of the main reasons for topological persistence being useful in data...
research
03/20/2019

Local Versus Global Distances for Zigzag Persistence Modules

This short note establishes explicit and broadly applicable relationship...
research
12/09/2022

Max filtering with reflection groups

Given a finite-dimensional real inner product space V and a finite subgr...
research
12/21/2018

Exact computation of the matching distance on 2-parameter persistence modules

The matching distance is a pseudometric on multi-parameter persistence m...
research
11/19/2021

Asymptotic Improvements on the Exact Matching Distance for 2-parameter Persistence

In the field of topological data analysis, persistence modules are used ...

Please sign up or login with your details

Forgot password? Click here to reset