Generalized Persistence Diagrams for Persistence Modules over Posets
arXiv:1810.11517 · doi:10.1007/s41468-021-00075-1
Abstract
When a category satisfies certain conditions, we define the notion of rank invariant for arbitrary poset-indexed functors from a category theory perspective. This generalizes the standard notion of rank invariant as well as Patel's recent extension. Specifically, the barcode of any interval decomposable persistence modules of finite dimensional vector spaces can be extracted from the rank invariant by the principle of inclusion-exclusion. Generalizing this idea allows freedom of choosing the indexing poset of in defining Patel's generalized persistence diagram of . Of particular importance is the fact that the generalized persistence diagram of is defined regardless of whether is interval decomposable or not. By specializing our idea to zigzag persistence modules, we also show that the barcode of a Reeb graph can be obtained in a purely set-theoretic setting without passing to the category of vector spaces. This leads to a promotion of Patel's semicontinuity theorem about type persistence diagram to Lipschitz continuity theorem for the category of sets.
The current version was accepted the Journal of Applied and Computational Topology, except that it contains a new appendix, Appendix H, where we establish the stability of our generalized rank invariant in a suitable setting. Version 4 contains alternative proofs of Proposition 3.17 under the assumption that the indexing poset P is the zigzag poset ZZ (in relation to Botnan and Lesnick's work)
References in corpus (1)
Cited by in corpus (15)
- Persistent Homology Analysis for Materials Research and Persistent Homology Software: HomCloud
- Edit Distance and Persistence Diagrams Over Lattices
- Graded persistence diagrams and persistence landscapes
- Homological approximations in persistence theory
- Virtual persistence diagrams, signed measures, Wasserstein distances, and Banach spaces
- On the stability of multigraded Betti numbers and Hilbert functions
- Approximation by interval-decomposables and interval resolutions of persistence modules
- On the bottleneck stability of rank decompositions of multi-parameter persistence modules
- Multi-Parameter Persistence Modules are Generically Indecomposable
- Harder-Narasimhan Filtrations of Persistence Modules
- Topological and metric properties of spaces of generalized persistence diagrams
- Stability for Inference with Persistent Homology Rank Functions
- Multi-parameter Module Approximation: an efficient and interpretable invariant for multi-parameter persistence modules with guarantees
- Poincaré Duality for Generalized Persistence Diagrams of (co)Filtrations
- Generalized Rank via Minimal Subposet