Related papers: An Isometry Theorem for Generalized Persistence Mo…
Persistent homology is a way of determining the topological properties of a data set. It is well known that each persistence module admits the structure of a representation of a finite totally ordered set. In previous work, the authors…
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…
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…
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…
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 2009, Chazal et al. introduced $\epsilon$-interleavings of persistence modules. $\epsilon$-interleavings induce a pseudometric $d_I$ on (isomorphism classes of) persistence modules, the interleaving distance. The definitions of…
The algebraic stability theorem for $\mathbb{R}$-persistence modules is a fundamental result in topological data analysis. We present a stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant…
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…
We introduce persistence with an emphasis on its algebraic foundations, using the representation theory of posets. Linear representations of posets arise in several areas of mathematics, including the representation theory of quivers and…
This paper explores persistence modules for circle-valued functions, presenting a new extension of the interleaving and bottleneck distances in this setting. We propose a natural generalisation of barcodes in terms of arcs on a geometric…
The persistence diagram of Cohen-Steiner, Edelsbrunner, and Harer was recently generalized by Patel to the case of constructible persistence modules with values in a symmetric monoidal category with images. Patel also introduced a distance…
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…
We prove a generalization of Gotzmann's persistence theorem in the case of modules with constant Hilbert polynomial. As a consequence, we show that the defining equations that give the embedding of a Quot scheme of points into a…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…
The interleaving distance, although originally developed for persistent homology, has been generalized to measure the distance between functors modeled on many posets or even small categories. Existing theories require that such a poset…
Multiparameter persistent homology has emerged as a powerful generalization of topological data analysis, capable of encoding multivariate filtrations. However, the algebraic complexity of multiparameter persistence modules, marked by wild…
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…
When a category $\mathcal{C}$ satisfies certain conditions, we define the notion of rank invariant for arbitrary poset-indexed functors $F:\mathbf{P} \rightarrow \mathcal{C}$ from a category theory perspective. This generalizes the standard…
An important problem in the field of Topological Data Analysis is defining topological summaries which can be combined with traditional data analytic tools. In recent work Bubenik introduced the persistence landscape, a stable…
We propose a functorial framework for persistent homology based on finite topological spaces and their associated posets. Starting from a finite metric space, we associate a filtration of finite topologies whose structure maps are…