相关论文: Erosion distance for generalized persistence modul…
Persistent homology was shown by Carlsson and Zomorodian to be homology of graded chain complexes with coefficients in the graded ring $\kk[t]$. As such, the behavior of persistence modules -- graded modules over $\kk[t]$ is an important…
Interleaving distances are used widely in Topological Data Analysis (TDA) as a tool for comparing topological signatures of datasets. The theory of interleaving distances has been extended through various category-theoretic constructions,…
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…
Persistent homology (PH) has been widely applied to graph data to extract topological features. However, little attention has been paid to how different distance functions on a graph affect the resulting persistence barcodes and their…
Persistence modules are a central algebraic object arising in topological data analysis. The notion of interleaving provides a natural way to measure distances between persistence modules. We consider various classes of persistence modules,…
The extended persistence diagram introduced by Cohen-Steiner, Edelsbrunner, and Harer is an invariant of real-valued continuous functions, which are $\mathbb{F}$-tame in the sense that all open interlevel sets have degree-wise…
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…
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…
Persistence diagrams are objects that play a central role in topological data analysis. In the present article, we investigate the local and global geometric properties of spaces of persistence diagrams. In order to do this, we construct a…
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…
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…
A standard way of approximating or discretizing a metric space is by taking its Rips complexes. These approximations for all parameters are often bound together into a filtration, to which we apply the fundamental group or the first…
We discuss the algebra behind the matrix reduction algorithm for persistent homology, as presented in the paper ''Computing Persistent Homology'' by Afra Zomorodian and Gunnar Carlsson, in the lens of the more modern characterization of…
In this article we establish two fundamental results for the sublevel set persistent homology for stationary processes indexed by the positive integers. The first is a strong law of large numbers for the persistence diagram (treated as a…
By invoking the reflection functors introduced by Bernstein, Gelfand, and Ponomarev in 1973, in this paper we define a metric on the space of all zigzag modules of a given length, which we call the reflection distance. We show that the…
We extend classical tools from rational homotopy theory to topological data analysis by introducing persistent Sullivan minimal models of persistent topological spaces. Our main result establishes that the interleaving distance between such…
Persistence modules serve as the algebraic foundation for topological data analysis, typically studied as representations of posets over a field. This article extends the structural and decomposition theory of persistence modules to the…
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 a new notion of persistence modules endowed with operators. It encapsulates the additional structure on Floer-type persistence modules coming from the intersection product with classes in the ambient (quantum) homology, along…
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…