Related papers: Computing Bottleneck Distance for Multi-parameter …
For any persistence module $M$ over a finite poset $\mathbf{P}$, and any interval $I$ of $\mathbf{P}$, we give a formula for the multiplicity $d_M(V_I)$ of the interval module $V_I$ in the indecomposable decomposition of $M$ in terms of the…
Algebraic persistence studies persistence modules (typically, linear representations of the poset $\mathbf{R}^n$ with $n \geq 1$) and the algebraic relationships between persistence modules that are interleaved. The notion of…
As well-known, inner functions play an important role in the study of bounded analytic function theory. In recent years, persistence module theory, as a main tool applied to Topological Data Analysis, has received widespread attention. In…
Persistent homology is a way of determining the topological properties of a data set. It is well known that each persistence module admits the structure of a representation of a finite totally ordered set. In previous work, the authors…
A persistence module with $m$ discrete parameters is a diagram of vector spaces indexed by the poset $\mathbb{N}^m$. If we are only interested in the large scale behavior of such a diagram, then we can consider two diagrams equivalent if…
In this article, we introduce a new parameterized family of topological descriptors, taking the form of candidate decompositions, for multi-parameter persistence modules, and we identify a subfamily of these descriptors, that we call…
The interleaving distance is arguably the most widely used metric in topological data analysis (TDA) due to its applicability to a wide array of inputs of interest, such as (multiparameter) persistence modules, Reeb graphs, merge trees, and…
While decomposition of one-parameter persistence modules behaves nicely, as demonstrated by the algebraic stability theorem, decomposition of multiparameter modules is known to be unstable in a certain precise sense. Until now, it has not…
A recent work by Lesnick and Wright proposed a visualisation of $2$D persistence modules by using their restrictions onto lines, giving a family of $1$D persistence modules. We give a constructive proof that any $1$D persistence module with…
In topological data analysis (TDA), persistence diagrams have been a succesful tool. To compare them, Wasserstein and Bottleneck distances are commonly used. We address the shortcomings of these metrics and show a way to investigate them in…
A persistence module $M$, with coefficients in a field $\mathbb{F}$, is a finite-dimensional linear representation of an equioriented quiver of type $A_n$ or, equivalently, a graded module over the ring of polynomials $\mathbb{F}[x]$. It is…
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…
In persistent homology analysis, interval modules play a central role in describing the birth and death of topological features across a filtration. In this work, we extend this setting, and propose the use of bipath persistent homology,…
We present a generalization of the induced matching theorem and use it to prove a generalization of the algebraic stability theorem for $\mathbb{R}$-indexed pointwise finite-dimensional persistence modules. Via numerous examples, we show…
The theory of persistence, which arises from topological data analysis, has been intensively studied in the one-parameter case both theoretically and in its applications. However, its extension to the multi-parameter case raises numerous…
In topological data analysis persistence modules are used to distinguish the legitimate topological features of a finite data set from noise. Interleavings between persistence modules feature prominantly in the analysis. One can show that…
This paper addresses two questions: (a) can we identify a sensible class of 2-parameter persistence modules on which the rank invariant is complete? (b) can we determine efficiently whether a given 2-parameter persistence module belongs to…
Multiparameter persistence is a natural extension of the well-known persistent homology, which has attracted a lot of interest. However, there are major theoretical obstacles preventing the full development of this promising theory. In this…
The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortunately suffers from…
In Topological Data Analysis, filtered chain complexes enter the persistence pipeline between the initial filtering of data and the final persistence invariants extraction. It is known that they admit a tame class of indecomposables, called…