Decomposing filtered chain complexes: geometry behind barcoding algorithms

DOI10.1016/J.COMGEO.2022.101938MaRDI QIDQ6355111arXivWikidataFDO

Authors Wojciech Chachólski, Barbara Giunti, Alvin Jin, C. Landi

Publication date 2 December 2020

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.COMGEO.2022.101938

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Chain complexes in algebraic topology (55U15)

arXiv classification

math.AT

Abstract: In Topological Data Analysis, filtered chain complexes enter the persistence pipeline between the initial filtering of data and the final persistence invariants extraction. It is known that they admit a tame class of indecomposables, called interval spheres. In this paper, we provide an algorithm to decompose filtered chain complexes into such interval spheres. This algorithm provides geometric insights into various aspects of the standard persistence algorithm and two of its run-time optimizations. Moreover, since it works for any filtered chain complexes, our algorithm can be applied in more general cases. As an application, we show how to decompose filtered kernels with it.

This page was built for publication: Decomposing filtered chain complexes: geometry behind barcoding algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6355111)