# A Theory of Sub-Barcodes

@article{Chubet2022ATO,
title={A Theory of Sub-Barcodes},
author={Oliver A. Chubet and Kirk P. Gardner and Don Sheehy},
journal={ArXiv},
year={2022},
volume={abs/2206.10504}
}
• Published 21 June 2022
• Computer Science
• ArXiv
From the work of Bauer and Lesnick, it is known that there is no functor from the category of pointwise ﬁnite-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…
1 Citations

## 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.

## References

SHOWING 1-10 OF 35 REFERENCES

### Induced matchings and the algebraic stability of persistence barcodes

• Mathematics
J. Comput. Geom.
• 2015

### 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.

### 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

• 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.

### Efficient Computation of Image Persistence

• Mathematics
ArXiv
• 2022
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:

### ∞-Categories for the Working Mathematician

• Mathematics
• 2018
homotopy theory C.1. Lifting properties, weak factorization systems, and Leibniz closure C.1.1. Lemma. Any class of maps characterized by a right lifting property is closed under composition,