Related papers: Stability of higher-dimensional interval decomposa…

The stability theorem for persistent homology is a central result in topological data analysis. While the original formulation of the result concerns the persistence barcodes of $\mathbb{R}$-valued functions, the result was later cast in a…

One of the main reasons for topological persistence being useful in data analysis is that it is backed up by a stability (isometry) property: persistence diagrams of $1$-parameter persistence modules are stable in the sense that the…

While decomposition of one-parameter persistence modules behaves nicely, as demonstrated by the algebraic stability theorem, decomposition of multiparameter modules is known to be unstable in a certain precise sense. Until now, it has not…

We present a generalization of the induced matching theorem and use it to prove a generalization of the algebraic stability theorem for $\mathbb{R}$-indexed pointwise finite-dimensional persistence modules. Via numerous examples, we show…

Algebraic persistence studies persistence modules (typically, linear representations of the poset $\mathbf{R}^n$ with $n \geq 1$) and the algebraic relationships between persistence modules that are interleaved. The notion of…

In this work, we present a generalization of extended persistent homology to filtrations of graded sub-groups by defining relative homology in this setting. Our work provides a more comprehensive and flexible approach to get an algebraic…

We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…

Persistence modules that decompose into interval modules are important in topological data analysis because we can interpret such intervals as the lifetime of topological features in the data. We can classify the settings in which…

Multidimensional persistence has been proposed to study the persistence of topological features in data indexed by multiple parameters. In this work, we further explore its algebraic complications from the point of view of higher…

The Isometry Theorem of Chazal et al. and Lesnick is a fundamental result in persistence theory, which states that the interleaving distance between two one-parameter persistence modules is equal to the bottleneck distance between their…

In this paper, we extend bottleneck stability to the setting of one dimensional constructible persistences module valued in any small abelian category.

The theory of persistence, which arises from topological data analysis, has been intensively studied in the one-parameter case both theoretically and in its applications. However, its extension to the multi-parameter case raises numerous…

Computation of the interleaving distance between persistence modules is a central task in topological data analysis. For $1$-parameter persistence modules, thanks to the isometry theorem, this can be done by computing the bottleneck…

The stability of persistence diagrams is among the most important results in applied and computational topology. Most results in the literature phrase stability in terms of the bottleneck distance between diagrams and the $\infty$-norm of…

We study distances on zigzag persistence modules from the viewpoint of derived categories and Auslander--Reiten quivers. The derived category of ordinary persistence modules is derived equivalent to that of arbitrary zigzag persistence…

Recently, bipath persistent homology has been proposed as an extension of standard persistent homology, along with its visualization (bipath persistence diagram) and computational methods. In the setting of standard persistent homology, the…

We show that computing the interleaving distance between two multi-graded persistence modules is NP-hard. More precisely, we show that deciding whether two modules are $1$-interleaved is NP-complete, already for bigraded, interval…

The stability of topological persistence is one of the fundamental issues in topological data analysis. Numerous methods have been proposed to address the stability of persistent modules or persistence diagrams. Recently, the concept of…

We consider the question of defining interleaving metrics on generalized persistence modules over arbitrary preordered sets. Our constructions are functorial, which implies a form of stability for these metrics. We describe a large class of…

In recent work, generalized persistence modules have proved useful in distinguishing noise from the legitimate topological features of a data set. Algebraically, generalized persistence modules can be viewed as representations for the poset…