Related papers: Ladder Decomposition for Morphisms of Persistence …
We consider a possibility of the existence of intersection homology morphism, which would be associated to a map of analytic varieties. We assume that the map is an inclusion of codimension one. Then the existence of a morphism follows from…
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…
Local conditions for the direct summands of a persistence module to belong to a certain class of indecomposables have been proposed in the 2-parameter setting, notably for the class of indecomposables called block modules, which plays a…
We investigate combinatorial dynamical systems on simplicial complexes considered as {\em finite topological spaces}. Such systems arise in a natural way from sampling dynamics and may be used to reconstruct some features of the dynamics…
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…
We expand the toolbox of (co)homological methods in computational topology by applying the concept of persistence to sheaf cohomology. Since sheaves (of modules) combine topological information with algebraic information, they allow for…
The $\gamma$-linear projected barcode was recently introduced as an alternative to the well-known fibered barcode for multiparameter persistence, in which restrictions of the modules to lines are replaced by pushforwards of the modules…
Multiparameter persistence modules come up naturally in topological data analysis and topological robotics. Given a metric graph $(X,\delta)$, the second configuration space of $(X,\delta)$ with proximity parameters (for example, the…
Although there is no doubt that multi-parameter persistent homology is a useful tool to analyse multi-variate data, efficient ways to compute these modules are still lacking in the available topological data analysis toolboxes. Other issues…
Given a functor from any category into the category of topological spaces, one obtains a linear representation of the category by post-composing the given functor with a homology functor with field coefficients. This construction is…
The algebraic stability theorem for $\mathbb{R}$-persistence modules is a fundamental result in topological data analysis. We present a stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant…
In order to better understand and to compare interleavings between persistence modules, we elaborate on the algebraic structure of interleavings in general settings. In particular, we provide a representation-theoretic framework for…
Weighted digraphs are used to model a variety of natural systems and can exhibit interesting structure across a range of scales. In order to understand and compare these systems, we require stable, interpretable, multiscale descriptors. To…
A theory of modules over posets is developed to define computationally feasible, topologically interpretable data structures, in terms of birth and death of homology classes, for persistent homology with multiple real parameters. To replace…
We study the inverse problem for persistent homology: For a fixed simplicial complex $K$, we analyse the fiber of the continuous map $\mathrm{PH}$ on the space of filters that assigns to a filter $f: K \to \mathbb R$ the total barcode of…
We study pointwise free and finitely-generated persistence modules over a principal ideal domain, indexed by a (possibly infinite) totally-ordered poset category. We show that such persistence modules admit interval decompositions if and…
Let H be a graded Hecke algebra with complex deformation parameters and Weyl group W. We show that the Hochschild, cyclic and periodic cyclic homologies of H are all independent of the parameters, and compute them explicitly. We use this to…
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…
Dey and Xin (J.Appl.Comput.Top., 2022, arXiv:1904.03766) describe an algorithm to decompose finitely presented multiparameter persistence modules using a matrix reduction algorithm. Their algorithm only works for modules whose generators…
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…