Abstract: Persistence has proved to be a valuable tool to analyze real world data robustly. Several approaches to persistence have been attempted over time, some topological in flavor, based on the vector space-valued homology functor, other combinatorial, based on arbitrary set-valued functors. To unify the study of topological and combinatorial persistence in a common categorical framework, we give axioms for a generalized rank function on objects in a target category, so that functors to that category induce persistence functions. We port the interleaving and bottleneck distances to this novel framework and generalize classical equalities and inequalities. Unlike sets and vector spaces, in many categories the rank of an object does not identify it up to isomorphism: to preserve information about the structure of persistence modules, we define colorable ranks, persistence diagrams and prove the equality between multicolored bottleneck distance and interleaving distance in semisimple Abelian categories. To illustrate our framework in practice, we give examples of multicolored persistent homology on filtered topological spaces with a group action and labeled point cloud data.
Recommendations
Cites work
- A Mayer-Vietoris formula for persistent homology with an application to shape recognition in the presence of occlusions
- Categorification of persistent homology
- scientific article; zbMATH DE number 1303764 (Why is no real title available?)
- Natural pseudo-distance and optimal matching between reduced size functions
- On the Krull-Schmidt theorem with application to sheaves
- On the local behavior of spaces of natural images
- Persistence theory. From quiver representations to data analysis
- Persistent homology -- a survey
- Proximity of persistence modules and their diagrams
- Size functions and formal series
- Stability of persistence diagrams
- The structure and stability of persistence modules
- Topological graph persistence
- Topological persistence and simplification
- Topology and data
- Unzerlegbare Darstellungen. I. (Indecomposable representations. I)
Cited in
(13)- Persistent local systems
- Categorification of persistent homology
- Verification, Model Checking, and Abstract Interpretation
- Steady and ranging sets in graph persistence
- A new measure for the attitude to mobility of Italian students and graduates: a topological data analysis approach
- scientific article; zbMATH DE number 7692244 (Why is no real title available?)
- Exact weights, path metrics, and algebraic Wasserstein distances
- On reachability categories, persistence, and commuting algebras of quivers
- Hochschild homology, and a persistent approach via connectivity digraphs
- Stability and extension of steady and ranging persistence
- Inconsistency and rank preservation
- Topological graph persistence
- Metrics for generalized persistence modules
This page was built for publication: Rank-based persistence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220052)
