Parallel decomposition of persistence modules through interval bases

arXiv2106.11884MaRDI QIDQ6370976FDOQ6370976

Francesco Vaccarino, Sara Scaramuccia, Alessandro De Gregorio, Marco Guerra

Publication date: 22 June 2021

Abstract: We introduce an algorithm to decompose any finite-type persistence module with coefficients in a field into what we call an {em interval basis}. This construction yields both the standard persistence pairs of Topological Data Analysis (TDA), as well as a special set of generators inducing the interval decomposition of the Structure theorem. The computation of this basis can be distributed over the steps in the persistence module. This construction works for general persistence modules on a field $mathbbF$, not necessarily deriving from persistent homology. We subsequently provide a parallel algorithm to build a persistent homology module over $mathbbR$ by leveraging the Hodge decomposition, thus providing new motivation to explore the interplay between TDA and the Hodge Laplacian.

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Computational homological algebra (13P20) Topological data analysis (62R40)

This page was built for publication: Parallel decomposition of persistence modules through interval bases

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