Related papers: An Excision Theorem for Persistent Homology
We set up the theory for a distributed algorithm for computing persistent homology. For this purpose we develop linear algebra of persistence modules. We present bases of persistence modules, and give motivation as for the advantages of…
We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method…
We show, in Zermelo-Fraenkel set theory without the Axiom of Choice, that the existence of a discontinuous homomorphism of the additive group of real numbers induces a selector for the Vitali equivalence relation $\mathbb{R}/\mathbb{Q}$.…
Persistent homology, an algebraic method for discerning structure in abstract data, relies on the construction of a sequence of nested topological spaces known as a filtration. Two-parameter persistent homology allows the analysis of data…
We introduce several geometric notions, including the width of a homology class, to the theory of persistent homology. These ideas provide geometric interpretations of persistence diagrams. Indeed, we give quantitative and geometric…
The Extended Persistent Homology Transform (XPHT) is a topological transform which takes as input a shape embedded in Euclidean space, and to each unit vector assigns the extended persistence module of the height function over that shape…
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…
This paper aims to introduce a filtration analysis of sampled maps based on persistent homology, providing a new method for reconstructing the underlying maps. The key idea is to extend the definition of homology induced maps of…
We use the abstract setting of excisive functors in the language of $\infty$-categories to show that the best approximation to the $\ell^1$-homology functor by an excisive functor is trivial. Then we make an effort to explain the used…
In this paper we prove a sufficient condition for the existence of matchings in arbitrary groups and its linear analogue, which lead to some generalizations of the existing results in the theory of matchings in groups and central extensions…
Persistent homology is a popular data analysis technique that is used to capture the changing topology of a filtration associated with some simplicial complex $K$. These topological changes are summarized in persistence diagrams. We propose…
The theory of multidimensional persistence captures the topology of a multifiltration -- a multiparameter family of increasing spaces. Multifiltrations arise naturally in the topological analysis of scientific data. In this paper, we give a…
Biological and physical systems often exhibit distinct structures at different spatial/temporal scales. Persistent homology is an algebraic tool that provides a mathematical framework for analyzing the multi-scale structures frequently…
It is shown that the Mayer-Vietoris sequence holds for the cohomology of complexes of Lie algebroids which are defined on simplicial complexes and satisfy the compatibility condition concerning restrictions to the faces of each simplex. The…
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…
Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…
We prove a version of the Mayer-Vietoris sequence for De Rham differential forms in diffeological spaces. It is based on the notion of a generating family instead of that of a covering by open subsets.
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
We reformulate the persistent (co)homology of simplicial filtrations, viewed from a more algebraic setting, namely as the (co)homology of a chain complex of graded modules over polynomial ring $K[t]$. We also define persistent (co)homology…
In this paper we develop the theory of weighted persistent homology. In 1990, Robert J. Dawson was the first to study in depth the homology of weighted simplicial complexes. We generalize the definitions of weighted simplicial complex and…