Related papers: The Space of Barcode Bases for Persistence Modules
Given a pointwise finite-dimensional persistence module over a totally ordered set $S$, a theorem of Crawley-Boevey guarantees the existence of a barcode. When the set $S$ is finite, the persistence module is an equioriented type-A quiver…
We study circle valued maps and consider the persistence of the homology of their fibers. The outcome is a finite collection of computable invariants which answer the basic questions on persistence and in addition encode the topology of the…
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…
A barcode is a finite multiset of intervals on the real line, $B = \{ (b_i, d_i)\}_{i=1}^n$. Barcodes are important objects in topological data analysis, where they serve as summaries of the persistent homology groups of a filtration. The…
It is well-known that the cohomology ring has a richer structure than homology groups. However, until recently, the use of cohomology in persistence setting has been limited to speeding up of barcode computations. Some of the recently…
When filtering a topological space by a single parameter, the theory of quiver representations provides a complete framework for decomposing the resulting persistence module to obtain its barcode. This is achieved by interpreting the…
A central challenge in topological data analysis is the interpretation of barcodes. The classical algebraic-topological approach to interpreting homology classes is to build maps to spaces whose homology carries semantics we understand and…
Computing persistence over changing filtrations give rise to a stack of 2D persistence diagrams where the birth-death points are connected by the so-called `vines'. We consider computing these vines over changing filtrations for zigzag…
An ideal invariant for multiparameter persistence would be discriminative, computable and stable. In this work we analyse the discriminative power of a stable, computable invariant of multiparameter persistence modules: the fibered bar…
A multiplication on persistence diagrams is introduced by means of Schubert calculus. The key observation behind this multiplication comes from the fact that the representation space of persistence modules has the structure of the Schubert…
We prove that pointwise finite-dimensional S^1 persistence modules over an arbitrary field decompose uniquely, up to isomorphism, into the direct sum of a bar code and finitely-many Jordan cells. These persistence modules have also been…
This paper reviews the description of "bar codes" for a continuous real-valued map and explains how to recover the Morse complex of a Morse function from them. In this presentation the bar codes appear as the support of two vector-space…
Persistence modules are a central algebraic object arising in topological data analysis. The notion of interleaving provides a natural way to measure distances between persistence modules. We consider various classes of persistence modules,…
In persistent topology, q-tame modules appear as a natural and large class of persistence modules indexed over the real line for which a persistence diagram is definable. However, unlike persistence modules indexed over a totally ordered…
Persistent homology is a fundamental tool in Topological Data Analysis. The associated algebraic structure is the persistence module, a sequence of vector spaces connected by linear maps. Persistence modules admit a complete and…
One of the main objectives of topological data analysis is the study of discrete invariants for persistence modules, in particular when dealing with multiparameter persistence modules. In many cases, the invariants studied for these…
This paper develops the idea of homology for 1-parameter families of topological spaces. We express parametrized homology as a collection of real intervals with each corresponding to a homological feature supported over that interval or,…
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…
This paper explores persistence modules for circle-valued functions, presenting a new extension of the interleaving and bottleneck distances in this setting. We propose a natural generalisation of barcodes in terms of arcs on a geometric…
The stability theorem for persistent homology is a central result in topological data analysis. While the original formulation of the result concerns the persistence barcodes of $\mathbb{R}$-valued functions, the result was later cast in a…