Related papers: A directed persistent homology theory for dissimil…
We prove an extension to the simplicial Nerve Lemma which establishes isomorphism of persistent homology groups, in the case where the covering spaces are filtered. While persistent homology is now widely used in topological data analysis,…
By a theorem of Bernhard Keller the de Rham cohomology of a smooth variety is isomorphic to the periodic cyclic homology of the differential graded category of perfect complexes on the variety. Both the de Rham cohomology and the cyclic…
Quandle homology theory has been developed and cocycles have been used to define invariants of oriented classical or surface links. We introduce a shifting chain map $\sigma$ on each quandle chain complex that lowers the dimensions by one.…
This paper discusses the formalization of proofs "by diagram chasing", a standard technique for proving properties in abelian categories. We discuss how the essence of diagram chases can be captured by a simple many-sorted first-order…
We address the problem of estimating topological features from data in high dimensional Euclidean spaces under the manifold assumption. Our approach is based on the computation of persistent homology of the space of data points endowed with…
Homology with values in a connection with possibly irregular singular points on an algebraic curve is defined, generalizing homology with values in the underlying local system for a connection with regular singular points. Integration…
Many multi-variate time series obtained in the natural sciences and engineering possess a repetitive behavior, as for instance state-space trajectories of industrial machines in discrete automation. Recovering the times of recurrence from…
Geometric representations of cycles in quandle homology theory are given in terms of colored knot diagrams. Abstract knot diagrams are generalized to diagrams with exceptional points which, when colored, correspond to degenerate cycles.…
Persistent Homology is a powerful tool in Topological Data Analysis (TDA) to capture topological properties of data succinctly at different spatial resolutions. For graphical data, shape, and structure of the neighborhood of individual data…
We introduce lifespan functors, which are endofunctors on the category of persistence modules that filter out intervals from barcodes according to their boundedness properties. They can be used to classify injective and projective objects…
This work is part of a series of papers focusing on multipath cohomology of directed graphs. Multipath cohomology is defined as the (poset) homology of the path poset -- i.e., the poset of disjoint simple paths in a graph -- with respect to…
Within the context of topological data analysis, the problems of identifying topological significance and matching signals across datasets are important and useful inferential tasks in many applications. The limitation of existing solutions…
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…
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…
The persistent homology transform (PHT) of a subset $M \subset \mathbb{R}^d$ is a map $\text{PHT}(M):\mathbb{S}^{d-1} \to \mathbf{Dgm}$ from the unit sphere to the space of persistence diagrams. This map assigns to each direction $v\in…
We propose a unified framework based on persistent homology (PH) to characterize both local and global structures in disordered systems. It can simultaneously generate local and global descriptors using the same algorithm and data…
We show in this work that homology in degree d of a congruence group, in a very general framework, defines a weakly polynomial functor of degree at most 2d and we describe this functor modulo polynomial functors of smaller degree. Our main…
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…
Persistent homology studies the birth and death of cycles in a parameterized family of spaces. In this paper, we study the birth and death of cycles in a multifiltration of a chain complex with the goal of producing a persistence diagram…
We propose a general technique for extracting a larger set of stable information from persistent homology computations than is currently done. The persistent homology algorithm is usually viewed as a procedure which starts with a filtered…