On the structural theorem of persistent homology
From MaRDI portal
Publication:2334510
Abstract: We study the categorical framework for the computation of persistent homology, without reliance on a particular computational algorithm. The computation of persistent homology is commonly summarized as a matrix theorem, which we call the Matrix Structural Theorem. Any of the various algorithms for computing persistent homology constitutes a constructive proof of the Matrix Structural Theorem. We showthat the Matrix Structural Theorem is equivalent to the Krull-Schmidt property of the category of filtered chain complexes. We separately establish the Krull-Schmidt property by abstract categorical methods, yielding a novel nonconstructive proof of the Matrix Structural Theorem. These results provide the foundation for an alternate categorical framework for decomposition in persitent homology, bypassing the usual persistence vector spaces and quiver representations.
Recommendations
- Persistent homology and Auslander-Reiten theory
- Persistent homology and applied homotopy theory
- Persistent homology -- a survey
- Persistent homology: theory and practice
- Persistent Homology and Nested Dissection
- The persistent homology of a self-map
- The persistence space in multidimensional persistent homology
- Categorification of persistent homology
- Persistent intersection homology
- Persistent Homology of Semialgebraic Sets
Cites work
- scientific article; zbMATH DE number 5984526 (Why is no real title available?)
- scientific article; zbMATH DE number 5761737 (Why is no real title available?)
- scientific article; zbMATH DE number 5506200 (Why is no real title available?)
- scientific article; zbMATH DE number 2016138 (Why is no real title available?)
- scientific article; zbMATH DE number 195102 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 826242 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- scientific article; zbMATH DE number 3195417 (Why is no real title available?)
- Auslander-Reiten theory in a Krull-Schmidt category
- Barcodes: The persistent topology of data
- Computing persistent homology
- Dualities in persistent (co)homology
- Geometric and topological inference
- Krull-Schmidt categories and projective covers
- Localized homology
- On the Krull-Schmidt theorem with application to sheaves
- On the structural theorem of persistent homology
- Persistence theory. From quiver representations to data analysis
- Persistent homology for kernels, images, and cokernels
- Quiver representations.
- Stability of persistence diagrams
- Topological pattern recognition for point cloud data
- Topological persistence and simplification
- Topology and data
- Topology for Computing
- Zigzag Persistence via Reflections and Transpositions
- Zigzag persistence
- Zigzag persistent homology and real-valued functions
Cited in
(18)- Decomposition of persistence modules
- Magnitude meets persistence: homology theories for filtered simplicial sets
- Matrix method for persistence modules on commutative ladders of finite type
- Parametrized homology via zigzag persistence
- scientific article; zbMATH DE number 7731059 (Why is no real title available?)
- On the structural theorem of persistent homology
- Nori diagrams and persistent homology
- On the persistent homology of almost surely \(C^0\) stochastic processes
- Exact weights, path metrics, and algebraic Wasserstein distances
- Lifespan functors and natural dualities in persistent homology
- Homological algebra for persistence modules
- Persistent Homology and Nested Dissection
- scientific article; zbMATH DE number 6832329 (Why is no real title available?)
- Persistence diagrams as diagrams: a categorification of the stability theorem
- The representation theorem of persistence revisited and generalized
- \(p\)-cyclic persistent homology and Hofer distance
- scientific article; zbMATH DE number 5507818 (Why is no real title available?)
- Decomposing filtered chain complexes: geometry behind barcoding algorithms
This page was built for publication: On the structural theorem of persistent homology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334510)