Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe structure and stability of persistence modules
162
0
0.0
(
0
)
Added by
Frederic Chazal
Publication date
2012
fields
Informatics Engineering
and research's language is
English
Authors
Frederic Chazal
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
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$.
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 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.
In this paper we study the properties of the homology of different geometric filtered complexes (such as Vietoris-Rips, Cech and witness complexes) built on top of precompact spaces. Using recent developments in the theory of topological persistence we provide simple and natural proofs of the stability of the persistent homology of such complexes with respect to the Gromov--Hausdorff distance. We also exhibit a few noteworthy properties of the homology of the Rips and Cech complexes built on top of compact spaces.
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, including many of those that have been previously studied, and describe the relationships between them. In the cases where these classes are sets, interleaving distance induces a topology. We undertake a systematic study the resulting topological spaces and their basic topological properties.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
