Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Comparison Framework for Interleaved Persistence Modules
286
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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 how the generalized algebraic stability theorem enables the computation of rigorous error bounds in the space of persistence diagrams that go beyond the typical formulation in terms of bottleneck (or log bottleneck) distance.
rate research
Read More
We develop some aspects of the homological algebra of persistence modules, in both the one-parameter and multi-parameter settings, considered as either sheaves or graded modules. The two theories are different. We consider the graded module and sheaf tensor product and Hom bifunctors as well as their derived functors, Tor and Ext, and give explicit computations for interval modules. We give a classification of injective, projective, and flat interval modules. We state Kunneth theorems and universal coefficient theorems for the homology and cohomology of chain complexes of persistence modules in both the sheaf and graded modules settings and show how these theorems can be applied to persistence modules arising from filtered cell complexes. We also give a Gabriel-Popescu theorem for persistence modules. Finally, we examine categories enriched over persistence modules. We show that the graded module point of view produces a closed symmetric monoidal category that is enriched over itself.
The classical persistence algorithm virtually computes the unique decomposition of a persistence module implicitly given by an input simplicial filtration. Based on matrix reduction, this algorithm is a cornerstone of the emergent area of topological data analysis. Its input is a simplicial filtration defined over the integers $mathbb{Z}$ giving rise to a $1$-parameter persistence module. It has been recognized that multi-parameter version of persistence modules given by simplicial filtrations over $d$-dimensional integer grids $mathbb{Z}^d$ is equally or perhaps more important in data science applications. However, in the multi-parameter setting, one of the main challenges is that topological summaries based on algebraic structure such as decompositions and bottleneck distances cannot be as efficiently computed as in the $1$-parameter case because there is no known extension of the persistence algorithm to multi-parameter persistence modules. We present an efficient algorithm to compute the unique decomposition of a finitely presented persistence module $M$ defined over the multiparameter $mathbb{Z}^d$.The algorithm first assumes that the module is presented with a set of $N$ generators and relations that are emph{distinctly graded}. Based on a generalized matrix reduction technique it runs in $O(N^{2omega+1})$ time where $omega<2.373$ is the exponent for matrix multiplication. This is much better than the well known algorithm called Meataxe which runs in $tilde{O}(N^{6(d+1)})$ time on such an input. In practice, persistence modules are usually induced by simplicial filtrations. With such an input consisting of $n$ simplices, our algorithm runs in $O(n^{2omega+1})$ time for $d=2$ and in $O(n^{d(2omega + 1)})$ time for $d>2$.
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 the noetherian hypothesis in the general setting of modules over posets, a finitely encoded condition is defined combinatorially and developed algebraically. It captures topological tameness of persistent homology. Poset-modules satisfying it can be specified by fringe presentations that reflect birth-and-death descriptions of persistence. A syzygy theorem characterizes finitely encoded modules as admitting appropriately finite presentations and resolutions. The geometric and algebraic theory focuses on modules over real polyhedral groups (real vector spaces with polyhedral positive cones) and a parallel theory over discrete polyhedral groups (abelian groups with finitely generated positive cones). Existence of primary decomposition is proved over arbitrary polyhedral partially ordered abelian groups, but the real and discrete cases carry enough geometry and, crucially in the real case, topology to induce complete theories of minimal primary and secondary decomposition, associated and attached faces, minimal generators and cogenerators, socles and tops, minimal upset covers and downset hulls, Matlis duality, and minimal fringe presentation. Real semialgebraic properties of data are preserved by functorial constructions. Tops and socles become functorial birth and death spaces for multiparameter persistence modules. They yield functorial QR codes and elder morphisms for modules over real and discrete polyhedral groups that generalize and categorify the bar code and elder rule for persistent homology in one parameter. The disparate ways that QR codes and elder morphisms model bar codes coalesce, in one parameter, to functorial bar codes.
The notion of persistence partial matching, as a generalization of partial matchings between persistence modules, is introduced. We study how to obtain a persistence partial matching $mathcal{G}_f$, and a partial matching $mathcal{M}_f$, induced by a morphism $f$ between persistence modules, both being linear with respect to direct sums of morphisms. Some of their properties are also provided, including their stability after a perturbation of the morphism $f$, and their relationship with other induced partial matchings already defined in TDA.
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified using a new notation for calculations on quiver representations. We show that the stringent finiteness conditions required by traditional methods are not necessary to prove the existence and stability of the persistence diagram. We introduce weaker hypotheses for taming persistence modules, which are met in practice and are strong enough for the theory still to work. The constructions and proofs enabled by our framework are, we claim, cleaner and simpler.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
