# Categorification of Persistent Homology

@article{Bubenik2014CategorificationOP,
title={Categorification of Persistent Homology},
author={Peter Bubenik and Jonathan A. Scott},
journal={Discrete \& Computational Geometry},
year={2014},
volume={51},
pages={600-627}
}
• Published 16 May 2012
• Mathematics
• Discrete & Computational Geometry
We redevelop persistent homology (topological persistence) from a categorical point of view. The main objects of study are $\mathbf {(\mathbb {R},\leq)}$-indexed diagrams in some target category. A set of such diagrams has an interleaving distance, which we show generalizes the previously studied bottleneck distance. To illustrate the utility of this approach, we generalize previous stability results for persistence, extended persistence, and kernel, image, and cokernel persistence. We give a…
154 Citations
Generalized persistence diagrams
• A. Patel
• Mathematics
J. Appl. Comput. Topol.
• 2018
The persistence diagram of Cohen-Steiner, Edelsbrunner, and Harer is generalized to the setting of constructible persistence modules valued in a symmetric monoidal category and a second type of persistence diagram is defined, which enjoys a stronger stability theorem.
Persistence modules: Algebra and algorithms
• Mathematics
ArXiv
• 2013
A number of facts about persistence modules are presented; ranging from the well-known but under-utilized to the reconstruction of techniques to work in a purely algebraic approach to persistent homology.
Persistent homology and microlocal sheaf theory
• Mathematics
J. Appl. Comput. Topol.
• 2018
A pseudo-distance is introduced on the derived category of sheaves on a real finite-dimensional vector space by using the operation of convolution and it is proved that these last sheaves are constant on stratifications byγ-locally closed sets, an analogue of barcodes in higher dimension.
Metrics for Generalized Persistence Modules
• Mathematics
Found. Comput. Math.
• 2015
This work considers the question of defining interleaving metrics on generalized persistence modules over arbitrary preordered sets, and introduces a distinction between ‘soft’ and ‘hard’ stability theorems.
Interleaving and Gromov-Hausdorff distance
• Mathematics
• 2017
One of the central notions to emerge from the study of persistent homology is that of interleaving distance. It has found recent applications in symplectic and contact geometry, sheaf theory,
Induced matchings and the algebraic stability of persistence barcodes
• Mathematics
J. Comput. Geom.
• 2015
This work shows explicitly how a $\delta$-interleaving morphism between two persistence modules induces a \$delta-matching between the barcodes of the two modules, and yields a novel "single-morphism" characterization of the interleaving relation on persistence modules.
A comparison framework for interleaved persistence modules
• Mathematics
J. Appl. Comput. Topol.
• 2019
We present a generalization of the induced matching theorem of as reported by Bauer and Lesnick (in: Proceedings of the thirtieth annual symposium computational geometry 2014) and use it to prove a
Death and extended persistence in computational algebraic topology
The main aim of this paper is to explore the ideas of persistent homology and extended persistent homology, and their stability theorems, using ideas from [Bubenik and Scott, 2014; Cohen-Steiner,
Multiplicative persistent distances
• Mathematics
• 2019
We define and study several new interleaving distances for persistent cohomology which take into account the algebraic structures of the cohomology of a space, for instance the cup product or the
Persistence Modules on Commutative Ladders of Finite Type
• Mathematics
Discret. Comput. Geom.
• 2016
It is proved that the commutative ladders of length less than 5 are representation-finite and explicitly show their Auslander–Reiten quivers.

## References

SHOWING 1-10 OF 49 REFERENCES
Extending Persistence Using Poincaré and Lefschetz Duality
• Mathematics
Found. Comput. Math.
• 2009
An algebraic formulation is given that extends persistence to essential homology for any filtered space, an algorithm is presented to calculate it, and how it aids the ability to recognize shape features for codimension 1 submanifolds of Euclidean space is described.
Metrics for Generalized Persistence Modules
• Mathematics
Found. Comput. Math.
• 2015
This work considers the question of defining interleaving metrics on generalized persistence modules over arbitrary preordered sets, and introduces a distinction between ‘soft’ and ‘hard’ stability theorems.
Multidimensional Interleavings and Applications to Topological Inference
An in-depth study of interleavings and interleaving distances is presented and several multidimensional analogues of a topological inference theorem of Chazal, Guibas, Oudot, and Skraba are proved.
Proximity of persistence modules and their diagrams
• Mathematics, Computer Science
SCG '09
• 2009
This paper presents new stability results that do not suffer from the restrictions of existing stability results, and makes it possible to compare the persistence diagrams of functions defined over different spaces, thus enabling a variety of new applications of the concept of persistence.
Persistent homology for kernels, images, and cokernels
• Mathematics
SODA
• 2009
The notion of persistent homology is extended to sequences of kernels, images, and cokernels of maps induced by inclusions in a filtration of pairs of spaces and it is proved that the persistence diagrams are stable.
The Structure and Stability of Persistence Modules
• Mathematics
Springer Briefs in Mathematics
• 2016
This book is a comprehensive treatment of the theory of persistence modules over the real line. It presents a set of mathematical tools to analyse the structure and to establish the stability of such
Semi-abelian categories
• Mathematics
• 2002
Stability of persistence diagrams
• Mathematics
SCG
• 2005
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the persistence diagram
Zigzag Persistence
• Mathematics
Found. Comput. Math.
• 2010
Zigzag persistence generalises the highly successful theory of persistent homology and addresses several situations which are not covered by that theory, and develops theoretical and algorithmic foundations with a view towards applications in topological statistics.
Barcodes: The persistent topology of data
This article surveys recent work of Carlsson and collaborators on applications of computational algebraic topology to problems of feature detection and shape recognition in high-dimensional data. The