DeepAI AI Chat
Log In Sign Up

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

by   Nicolas Berkouk, et al.

Extended and zigzag persistence were introduced more than ten years ago, as generalizations of ordinary persistence. While overcoming certain limitations of ordinary persistence, they both enjoy nice computational properties, which make them an intermediate between ordinary and multi-parameter persistence, with already existing efficient software implementations. Nevertheless, their algebraic theory is more intricate, and in the case of extended persistence, was formulated only very recently. In this context, this paper presents a richly illustrated self-contained introduction to the foundational aspects of the topic, with an eye towards recent applications in which they are involved, such as computational sheaf theory and multi-parameter persistence.


page 1

page 2

page 3

page 4


Revisiting Graph Persistence for Updates and Efficiency

It is well known that ordinary persistence on graphs can be computed mor...

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

When persistence diagrams are formalized as the Mobius inversion of the ...

Ghost imaging with the human eye

Computational ghost imaging relies on the decomposition of an image into...

Possibilistic decreasing persistence

A key issue in the handling of temporal data is the treatment of persist...

Persistence-perfect discrete gradient vector fields and multi-parameter persistence

The main objective of this paper is to introduce and study a notion of p...

On Association between Absolute and Relative Zigzag Persistence

Duality results connecting persistence modules for absolute and relative...

Simultaneously Updating All Persistence Values in Reinforcement Learning

In reinforcement learning, the performance of learning agents is highly ...