The reflection distance between zigzag persistence modules
From MaRDI portal
Publication:2324608
Abstract: 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 -bottleneck distance between their respective persistence diagrams.
Recommendations
- Local versus global distances for zigzag and multi-parameter persistence modules
- Algebraic stability of zigzag persistence modules
- Interval decomposition of infinite zigzag persistence modules
- The theory of the interleaving distance on multidimensional persistence modules
- Exact computation of the matching distance on 2-parameter persistence modules
- Exact computation of the matching distance on 2-parameter persistence modules
- Exact computation of the matching distance on 2-parameter persistence modules
- Proximity of persistence modules and their diagrams
- Zigzag Persistence via Reflections and Transpositions
- Ephemeral persistence modules and distance comparison
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 5506200 (Why is no real title available?)
- scientific article; zbMATH DE number 626734 (Why is no real title available?)
- scientific article; zbMATH DE number 1978331 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- A distance for similarity classes of submanifolds of a Euclidean space
- Alexander duality for parametrized homology
- Algebraic stability of zigzag persistence modules
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
- COXETER FUNCTORS AND GABRIEL'S THEOREM
- Categorification of persistent homology
- Category theory in context
- Computational topology. An introduction
- Computing persistent homology
- Computing the interleaving distance is NP-hard
- Induced matchings of barcodes and the algebraic stability of persistence
- Infinite matching theory
- Lipschitz functions have \(L_{p}\)-stable persistence
- Metrics for generalized persistence modules
- Persistence theory. From quiver representations to data analysis
- Proximity of persistence modules and their diagrams
- Stability of persistence diagrams
- The structure and stability of persistence modules
- The theory of the interleaving distance on multidimensional persistence modules
- Topological persistence and simplification
- Unzerlegbare Darstellungen. I. (Indecomposable representations. I)
- Zigzag persistence
Cited in
(8)- Interval decomposition of infinite zigzag persistence modules
- Virtual persistence diagrams, signed measures, Wasserstein distances, and Banach spaces
- Algebraic stability theorem for derived categories of zigzag persistence modules
- Exact weights, path metrics, and algebraic Wasserstein distances
- Computing the interleaving distance is NP-hard
- Zigzag Persistence via Reflections and Transpositions
- Generalized persistence diagrams for persistence modules over posets
- Local versus global distances for zigzag and multi-parameter persistence modules
This page was built for publication: The reflection distance between zigzag persistence modules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2324608)