A Theory of Sub-Barcodes

  title={A Theory of Sub-Barcodes},
  author={Oliver A. Chubet and Kirk P. Gardner and Don Sheehy},
From the work of Bauer and Lesnick, it is known that there is no functor from the category of pointwise finite-dimensional persistence modules to the category of barcodes and overlap matchings . In this work, we introduce sub-barcodes and show that there is a functor from the category of factorizations of persistence module homomorphisms to a poset of barcodes ordered by the sub-barcode relation . Sub-barcodes and factorizations provide a looser alternative to bottleneck matchings and… 

Figures from this paper

Maximum Subbarcode Matching and Subbarcode Distance

The subbarcode matching algorithm presented is a gener-alization of the up-right matching algorithm given by Karp et al [11], which has O ( n log n ) runtime, where n is the number of distinct intervals in the barcodes.



Induced matchings and the algebraic stability of persistence barcodes

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.

Persistence Diagrams as Diagrams: A Categorification of the Stability Theorem

This paper shows that an equivalent description of barcodes as functors R →Mch, where R is the poset category of real numbers and Mch is the category whose objects are sets and whose morphisms are matchings, gives a hitherto unstudied categorical structure on barcodes.

Categorification of Persistent Homology

This work redevelops persistent homology (topological persistence) from a categorical point of view and gives a natural construction of a category of ε-interleavings of $\mathbf {(\mathbb {R},\leq)}$-indexed diagrams in some target category and shows that if the target category is abelian, so is this category of interleavments.

The Theory of the Interleaving Distance on Multidimensional Persistence Modules

The theory of multidimensional interleavings is developed, with a view toward applications to topological data analysis, and it is shown that when the authors define their persistence modules over a prime field, d_\mathrm{I}$$dI satisfies a universality property.

Metrics for Generalized Persistence Modules

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.

Sheaves, Cosheaves and Applications

This thesis develops the theory of sheaves and cosheaves with an eye towards applications in science and engineering. To provide a theory that is computable, we focus on a combinatorial version of

Proximity of persistence modules and their diagrams

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.

Efficient Computation of Image Persistence

An algorithm for computing the barcode of the image of a morphism in persistent homology induced by an inclusion of filtered finite-dimensional chain complexes is presented and can be applied to inclusion-induced maps in persistent absolute homology and persistent relative cohomology for filtrations of pairs of simplicial complexes.

A comparison framework for interleaved persistence modules and applications of persistent homology to problems in fluid dynamics

OF THE DISSERTATION A comparison framework for interleaved persistence modules and applications of persistent homology to problems in fluid dynamics by RACHEL LEVANGER Dissertation Director:

Homological Algebra for Persistence Modules

It is shown that the graded module point of view produces a closed symmetric monoidal category that is enriched over itself, and a Gabriel–Popescu theorem for persistence modules is given.