Generalized Persistence Diagrams for Persistence Modules over Posets

by   Woojin Kim, et al.

When a category C satisfies certain conditions, we define the notion of rank invariant for arbitrary poset-indexed functors F:P→C 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 F:P→vec 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 P of F: P→C in defining Patel's generalized persistence diagram of F. 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 A persistence diagram to Lipschitz continuity theorem for the category of sets.


Rank invariant for Zigzag Modules

The rank invariant is of great interest in studying both one-dimensional...

Zig-Zag Modules: Cosheaves and K-Theory

Persistence modules have a natural home in the setting of stratified spa...

Rank-based persistence

Persistence has proved to be a valuable tool to analyze real world data ...

Steady and ranging sets in graph persistence

Generalised persistence functions (gp-functions) are defined on (ℝ, ≤)-i...

Relative Interlevel Set Cohomology Categorifies Extended Persistence Diagrams

The extended persistence diagram introduced by Cohen-Steiner, Edelsbrunn...

Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and its Applications

The notion of generalized rank invariant in the context of multiparamete...

A Sparse Delaunay Filtration

We show how a filtration of Delaunay complexes can be used to approximat...