Related papers: A-infinity Persistence
In this paper, we consider topological featurizations of data defined over simplicial complexes, like images and labeled graphs, obtained by convolving this data with various filters before computing persistence. Viewing a convolution…
We introduce harmonic persistent homology spaces for filtrations of finite simplicial complexes. As a result we can associate concrete subspaces of cycles to each bar of the barcode of the filtration. We prove stability of the harmonic…
By general case we mean methods able to process simplicial sets and chain complexes not of finite type. A filtration of the object to be studied is the heart of both subjects persistent homology and spectral sequences. In this paper we…
The persistent homology of a stationary point process on ${\bf R}^N$ is studied in this paper. As a generalization of continuum percolation theory, we study higher dimensional topological features of the point process such as loops,…
It has been shown that $1$-parameter persistence modules have a very simple classification, namely there is a discrete invariant called a barcode that completely characterizes $1$-parameter persistence modules up to isomorphism. In…
We introduce a sheaf-theoretic stability condition for finite acyclic quivers. Our main result establishes that for representations of affine type $\widetilde{\mathbb{A}}$ quivers, there is a precise relationship between the associated…
The persistence barcode is a topological descriptor of data that plays a fundamental role in topological data analysis. Given a filtration of data, the persistence barcode tracks the evolution of its homology groups. In this paper, we…
In this paper, we study the persistent homology of the offset filtration of algebraic varieties. We prove the algebraicity of two quantities central to the computation of persistent homology. Moreover, we connect persistent homology and…
The persistence barcode (equivalently, the persistence diagram), which can be obtained from the interval decomposition of a persistence module, plays a pivotal role in applications of persistent homology. For multi-parameter persistent…
This paper is a survey of persistent homology, primarily as it is used in topological data analysis. It includes the theory of persistence modules, as well as stability theorems for persistence barcodes, generalized persistence,…
We study the inverse problem for persistent homology: For a fixed simplicial complex $K$, we analyse the fiber of the continuous map $\mathrm{PH}$ on the space of filters that assigns to a filter $f: K \to \mathbb R$ the total barcode of…
In this paper we study multidimensional persistence modules [5,13] via what we call tame functors and noise systems. A noise system leads to a pseudo-metric topology on the category of tame functors. We show how this pseudo-metric can be…
The use of persistent homology in applications is justified by the validity of certain stability results. At the core of such results is a notion of distance between the invariants that one associates with data sets. Here we introduce a…
We give an algorithm with singly exponential complexity for computing the barcodes up to dimension $\ell$ (for any fixed $\ell \geq 0$) of the filtration of a given semi-algebraic set by the sub-level sets of a given polynomial. Our…
Persistent homology is a method for probing topological properties of point clouds and functions. The method involves tracking the birth and death of topological features (2000) as one varies a tuning parameter. Features with short…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…
Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…
A fundamental tool in topological data analysis is persistent homology, which allows extraction of information from complex datasets in a robust way. Persistent homology assigns a module over a principal ideal domain to a one-parameter…
This article grew out of the theoretical part of my Master's thesis at the Faculty of Mathematics and Information Science at Ruprecht-Karls-Universit\"at Heidelberg under the supervision of PD Dr. Andreas Ott. Following the work of G.…
In this paper, we define the homological Morse numbers of a filtered cell complex in terms of relative homology of nested filtration pieces, and derive inequalities relating these numbers to the Betti tables of the multi-parameter…