Related papers: On Level persistence (Relevant level persistence n…
In this note we recall the relations between the barcodes in level and sub-level persistence and make precise their relation with the Morse-Novikov complex of a Morse real- or angle-valued map. The results in this papers are implicit in my…
In this paper we introduce the persistent magnitude, a new numerical invariant of (sufficiently nice) graded persistence modules. It is a weighted and signed count of the bars of the persistence module, in which a bar of the form $[a,b)$ in…
Barcodes form a complete set of invariants for interval decomposable persistence modules and are an important summary in topological data analysis. The set of barcodes is equipped with a canonical one-parameter family of metrics, the…
The barcode of a persistence module serves as a complete combinatorial invariant of its isomorphism class. Barcodes are typically extracted by performing changes of basis on a persistence module until the constituent matrices have a special…
Persistence has proved to be a valuable tool to analyze real world data robustly. Several approaches to persistence have been attempted over time, some topological in flavor, based on the vector space-valued homology functor, other…
This paper provides a method to calculate the bar codes of a PCD (point cloud data) with real coefficients in Section 3. With Dan Burghelea and Tamal Dey we developed a persistence theory which involves level sets discussed in Section 4.…
The concept of topological persistence, introduced recently in computational topology, finds applications in studying a map in relation to the topology of its domain. Since its introduction, it has been extended and generalized in various…
A lower bound for the interleaving distance on persistence vector spaces is given in terms of rank invariants. This offers an alternative proof of the stability of rank invariants.
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 introduces a novel approach to multi-parameter persistence using 2-categorical structures. We develop a framework that captures hierarchical interactions between filter parameters, overcoming fundamental limitations of…
Persistent homology was shown by Carlsson and Zomorodian to be homology of graded chain complexes with coefficients in the graded ring $\kk[t]$. As such, the behavior of persistence modules -- graded modules over $\kk[t]$ is an important…
We develop the notion of a "filtered cospan" as an algebraic object that stands in the same relation to interlevel persistence modules as filtered chain complexes stand with respect to sublevel persistence modules. This relation is…
The persistence barcode is a well-established complete discrete invariant for finitely generated persistence modules [5] [1]. Its definition, however, does not extend to multi- dimensional persistence modules. In this paper, we introduce a…
Extended and zigzag persistence were introduced more than ten years ago, as generalizations of ordinary persistence. While overcoming certain limitations of ordinary persistence, they both enjoy nice computational properties, which make…
Persistent homology is a popular technique in topological data analysis that tracks the lifespans of homological features in a nested sequence of spaces. This data is typically presented in a multi-set called a persistence diagram or a…
The Lefschetz number and fixed point index can be thought of as two different descriptions of the same invariant. The Lefschetz number is algebraic and defined using homology. The index is defined more directly from the topology and is a…
An important problem in the field of Topological Data Analysis is defining topological summaries which can be combined with traditional data analytic tools. In recent work Bubenik introduced the persistence landscape, a stable…
In standard persistent homology, a persistent cycle born and dying with a persistence interval (bar) associates the bar with a concrete topological representative, which provides means to effectively navigate back from the barcode to the…
We consider different notions of equivalence for Morse functions on the sphere in the context of persistent homology, and introduce new invariants to study these equivalence classes. These new invariants are as simple, but more discerning…
We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up…