Related papers: Correspondence Modules and Persistence Sheaves: A …
We define a simple, explicit map sending a morphism $f:M \rightarrow N$ of pointwise finite dimensional persistence modules to a matching between the barcodes of $M$ and $N$. Our main result is that, in a precise sense, the quality of this…
Time-series of persistence diagrams, known as vineyards, have shown to be useful in diverse applications. A natural algebraic version of vineyards is a time series of persistence modules equipped with interleaving maps between the…
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…
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 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…
This work concerns the theoretical foundations of persistence-based topological data analysis. We develop theory of topological inference in the multidimensional persistence setting, and directly at the (topological) level of filtrations…
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…
We develop persistent homology in the setting of filtrations of (Cech) closure spaces. Examples of filtrations of closure spaces include metric spaces, weighted graphs, weighted directed graphs, and filtrations of topological spaces. We use…
A persistence module with $m$ discrete parameters is a diagram of vector spaces indexed by the poset $\mathbb{N}^m$. If we are only interested in the large scale behavior of such a diagram, then we can consider two diagrams equivalent if…
Multiparameter persistent homology has been largely neglected as an input to machine learning algorithms. We consider the use of lattice-based convolutional neural network layers as a tool for the analysis of features arising from…
The theory of multidimensional persistent homology was initially developed in the discrete setting, and involved the study of simplicial complexes filtered through an ordering of the simplices. Later, stability properties of…
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…
We show that a persistence module (for a totally ordered indexing set) consisting of finite-dimensional vector spaces is a direct sum of interval modules. The result extends to persistence modules with the descending chain condition on…
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…
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…
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…
Motivated by persistent homology and topological data analysis, we consider formal sums on a metric space with a distinguished subset. These formal sums, which we call persistence diagrams, have a canonical 1-parameter family of metrics…
A multiplication on persistence diagrams is introduced by means of Schubert calculus. The key observation behind this multiplication comes from the fact that the representation space of persistence modules has the structure of the Schubert…
In topological data analysis, we want to discern topological and geometric structure of data, and to understand whether or not certain features of data are significant as opposed to simply random noise. While progress has been made on…
Visualization in the emerging field of topological data analysis has progressed from persistence barcodes and persistence diagrams to display of two-parameter persistent homology. Although persistence barcodes and diagrams have permitted…