Related papers: An Excision Theorem for Persistent Homology
Persistent homology is a popular tool in Topological Data Analysis. It provides numerical characteristics of data sets which reflect global geometric properties. In order to be useful in practice, for example for feature generation in…
In this paper, we study further properties and applications of weighted homology and persistent homology. We introduce the Mayer-Vietoris sequence and generalized Bockstein spectral sequence for weighted homology. For applications, we show…
This thesis addresses the theory of topological spaces and the foundations of persistence theory. We will discuss chain complexes and the associated simplicial homology groups, as well as their relationship with singular homology theory.…
A method is presented for the distributed computation of persistent homology, based on an extension of the generalized Mayer-Vietoris principle to filtered spaces. Cellular cosheaves and spectral sequences are used to compute global…
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 introduce and investigate notions of persistent homology for p-groups and for coclass trees of p-groups. Using computer techniques we show that persistent homology provides fairly strong homological invariants for p-groups of order at…
We study the foundational properties of persistent homotopy groups and develop elementary computational methods for their analysis. Our main theorems are persistent analogues of the Van Kampen, excision, suspension, and Hurewicz theorems.…
The Mayer-Vietoris theorem is known for its wide applications, especially in determining homology. In fact, this theorem provides us with a long exact sequence, where the underlying homology groups fit in. However, this theorem does not…
Persistent homology is a natural tool for probing the topological characteristics of weighted graphs, essentially focusing on their $0$-dimensional homology. While this area has been substantially studied, we present a new approach to…
This article introduces an algorithm to compute the persistent homology of a filtered complex with various coefficient fields in a single matrix reduction. The algorithm is output-sensitive in the total number of distinct persistent…
We investigate to what extent persistent homology benefits from the properties of the usual homology theory.
In [1] it was shown that K^, a certain differential cohomology functor associated to complex K-theory, satisfies the Mayer-Vietoris property when the underlying manifold is compact. It turns out that this result is quite general. The work…
In [1] it was shown that K^, a certain differential cohomology functor associated to complex K-theory, satisfies the Mayer-Vietoris property when the underlying manifold is compact. It turns out that this result is quite general. The work…
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,…
This article studies the robust version of persistent homology based on trimming methodology to capture the geometric feature through support of the data in presence of outliers. Precisely speaking, the proposed methodology works when the…
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…
While persistent homology has taken strides towards becoming a wide-spread tool for data analysis, multidimensional persistence has proven more difficult to apply. One reason is the serious drawback of no longer having a concise and…
An algorithm is presented that constructs an acyclic partial matching on the cells of a given simplicial complex from a vector-valued function defined on the vertices and extended to each simplex by taking the least common upper bound of…
The Discrete Morse Theory of Forman appeared to be useful for providing filtration-preserving reductions of complexes in the study of persistent homology. So far, the algorithms computing discrete Morse matchings have only been used for…
We introduce a refinement of persistent homology that detects simple-homotopy-theoretic phenomena invisible to homology. Given a filtered simplicial complex, we define the Morse complexity profile as the minimal number of critical simplices…