Barcodes of towers and a streaming algorithm for persistent homology

From MaRDI portal
Publication:4580135

DOI10.4230/LIPICS.SOCG.2017.57zbMATH Open1436.55009arXiv1701.02208MaRDI QIDQ4580135FDOQ4580135


Authors: Michael Kerber, Hannah Schreiber Edit this on Wikidata


Publication date: 13 August 2018

Abstract: A tower is a sequence of simplicial complexes connected by simplicial maps. We show how to compute a filtration, a sequence of nested simplicial complexes, with the same persistent barcode as the tower. Our approach is based on the coning strategy by Dey et al. (SoCG 2014). We show that a variant of this approach yields a filtration that is asymptotically only marginally larger than the tower and can be efficiently computed by a streaming algorithm, both in theory and in practice. Furthermore, we show that our approach can be combined with a streaming algorithm to compute the barcode of the tower via matrix reduction. The space complexity of the algorithm does not depend on the length of the tower, but the maximal size of any subcomplex within the tower.


Full work available at URL: https://arxiv.org/abs/1701.02208




Recommendations





Cited In (8)

Uses Software





This page was built for publication: Barcodes of towers and a streaming algorithm for persistent homology

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