DeepAI AI Chat
Log In Sign Up

Computing Persistent Homology with Various Coefficient Fields in a Single Pass

by   Jean-Daniel Boissonnat, et al.

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 software library.


page 1

page 2

page 3

page 4


Wavelet-Based Density Estimation for Persistent Homology

Persistent homology is a central methodology in topological data analysi...

A flat persistence diagram for improved visualization of persistent homology

Visualization in the emerging field of topological data analysis has pro...

Neural Approximation of Extended Persistent Homology on Graphs

Persistent homology is a widely used theory in topological data analysis...

Keeping it sparse: Computing Persistent Homology revisited

In this work, we study several variants of matrix reduction via Gaussian...

Persistent Homology Transform Cosheaf

We employ the recent discovery of functoriality for persistent homology ...

Swap, Shift and Trim to Edge Collapse a Filtration

Boissonnat and Pritam introduced an algorithm to reduce a filtration of ...

Conceptualization of Object Compositions Using Persistent Homology

A topological shape analysis is proposed and utilized to learn concepts ...