Swap, Shift and Trim to Edge Collapse a Filtration

03/14/2022
by   Marc Glisse, et al.
0

Boissonnat and Pritam introduced an algorithm to reduce a filtration of flag (or clique) complexes, which can in particular speed up the computation of its persistent homology. They used so-called edge collapse to reduce the input flag filtration and their reduction method required only the 1-skeleton of the filtration. In this paper we revisit the usage of edge collapse for efficient computation of persistence homology. We first give a simple and intuitive explanation of the principles underlying that algorithm. This in turn allows us to propose various extensions including a zigzag filtration simplification algorithm. We finally show some experiments to better understand how it behaves.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/07/2022

MuRiT: Efficient Computation of Pathwise Persistence Barcodes in Multi-Filtered Flag Complexes via Vietoris-Rips Transformations

Multi-parameter persistent homology naturally arises in applications of ...
research
08/07/2019

Ripser: efficient computation of Vietoris-Rips persistence barcodes

We present an algorithm for the computation of Vietoris-Rips persistence...
research
04/23/2022

Fast Computation of Zigzag Persistence

Zigzag persistence is a powerful extension of the standard persistence w...
research
01/09/2020

Computing Persistent Homology with Various Coefficient Fields in a Single Pass

This article introduces an algorithm to compute the persistent homology ...
research
01/18/2021

Tiny Transducer: A Highly-efficient Speech Recognition Model on Edge Devices

This paper proposes an extremely lightweight phone-based transducer mode...
research
10/03/2019

Orbit Computation for Atomically Generated Subgroups of Isometries of Z^n

Isometries and their induced symmetries are ubiquitous in the world. Tak...

Please sign up or login with your details

Forgot password? Click here to reset