Computing persistent homology with various coefficient fields in a single pass

7Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article introduces an algorithm to compute the persistent homology of a filtered complex with various coefficient fields in a single matrix reduction. The algorithm is output-sensitive in the total number of distinct persistent homological features in the diagrams for the different coefficient fields. This computation allows us to infer the prime divisors of the torsion coefficients of the integral homology groups of the topological space at any scale, hence furnishing a more informative description of topology than persistence in a single coefficient field. We provide theoretical complexity analysis as well as detailed experimental results. The code is part of the Gudhi library, and is available at [8]. © 2014 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Boissonnat, J. D., & Maria, C. (2014). Computing persistent homology with various coefficient fields in a single pass. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8737 LNCS, pp. 185–196). Springer Verlag. https://doi.org/10.1007/978-3-662-44777-2_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free