Fast Minimal Presentations of Bi-graded Persistence Modules

10/29/2020
by   Michael Kerber, et al.
0

Multi-parameter persistent homology is a recent branch of topological data analysis. In this area, data sets are investigated through the lens of homology with respect to two or more scale parameters. The high computational cost of many algorithms calls for a preprocessing step to reduce the input size. In general, a minimal presentation is the smallest possible representation of a persistence module. Lesnick and Wright proposed recently an algorithm (the LW-algorithm) for computing minimal presentations based on matrix reduction. In this work, we propose, implement and benchmark several improvements over the LW-algorithm. Most notably, we propose the use of priority queues to avoid extensive scanning of the matrix columns, which constitutes the computational bottleneck in the LW-algorithm, and we combine their algorithm with ideas from the multi-parameter chunk algorithm by Fugacci and Kerber. Our extensive experiments show that our algorithm outperforms the LW-algorithm and computes the minimal presentation for data sets with millions of simplices within a few seconds. Our software is publicly available.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2019

Computing Minimal Presentations and Bigraded Betti Numbers of 2-Parameter Persistent Homology

Motivated by applications to topological data analysis, we give an effic...
research
07/22/2021

Compression for 2-Parameter Persistent Homology

Compression aims to reduce the size of an input, while maintaining its r...
research
02/15/2019

Computing Minimal Presentations and Betti Numbers of 2-Parameter Persistent Homology

Motivated by applications to topological data analysis, we give an effic...
research
04/07/2019

Generalized Persistence Algorithm for Decomposing Multi-parameter Persistence Modules

The classical persistence algorithm virtually computes the unique decomp...
research
06/04/2022

Efficient Approximation of Multiparameter Persistence Modules

Topological Data Analysis is a growing area of data science, which aims ...
research
11/19/2021

Asymptotic Improvements on the Exact Matching Distance for 2-parameter Persistence

In the field of topological data analysis, persistence modules are used ...
research
04/25/2021

Move Schedules: Fast persistence computations in sparse dynamic settings

The standard procedure for computing the persistent homology of a filter...

Please sign up or login with your details

Forgot password? Click here to reset