DeepAI AI Chat
Log In Sign Up

Output-sensitive Computation of Generalized Persistence Diagrams for 2-filtrations

by   Dmitriy Morozov, et al.

When persistence diagrams are formalized as the Mobius inversion of the birth-death function, they naturally generalize to the multi-parameter setting and enjoy many of the key properties, such as stability, that we expect in applications. The direct definition in the 2-parameter setting, and the corresponding brute-force algorithm to compute them, require Ω(n^4) operations. But the size of the generalized persistence diagram, C, can be as low as linear (and as high as cubic). We elucidate a connection between the 2-parameter and the ordinary 1-parameter settings, which allows us to design an output-sensitive algorithm, whose running time is in O(n^3 + Cn).


page 1

page 7

page 13

page 15

page 19


Poincaré Duality for Generalized Persistence Diagrams of (co)Filtrations

We dualize previous work on generalized persistence diagrams for filtrat...

Meta-Diagrams for 2-Parameter Persistence

We first introduce the notion of meta-rank for a 2-parameter persistence...

One Diamond to Rule Them All: Old and new topics about zigzag, levelsets and extended persistence

Extended and zigzag persistence were introduced more than ten years ago,...

Sketching Persistence Diagrams

Given a persistence diagram with n points, we give an algorithm that pro...

Move Schedules: Fast persistence computations in sparse dynamic settings

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

Bayesian Topological Learning for Classifying the Structure of Biological Networks

Actin cytoskeleton networks generate local topological signatures due to...

Reduction Algorithms for Persistence Diagrams of Networks: CoralTDA and PrunIT

Topological data analysis (TDA) delivers invaluable and complementary in...