Decomposition of zero-dimensional persistence modules via rooted subsets
Alonso and Kerber introduce the notion of \(root\) \(subset\) to study the decomposition of zero-dimensional persistence modules. Instead of studying the decomposition of the persistence module directly in the category of (graded) vector space, the paper works in the category of \( persistence\) \(set\) \(S\), whose object can be interpreted as a two-parameter hierarchical clustering.\N\NAfter recalling basic concepts from persistence theory, Alonso and Kerber characterize the properties of the idempotent endomorphism \(\varphi\) and the generators of \(S\). A central result shows that the persistence module \(\mathcal{L}S\) decomposes into \(\textrm{img}(id_{\mathcal{L}S}-\mathcal{L}\varphi)\oplus \mathcal{L}(\textrm{img}\varphi)\), where \(\mathcal{L}\) is a linearization functor. Consequently, intervals of a persistence module of the form \(\mathcal{L}S\) can be iteratively peeled off by finding a root generator of \(S\) with associated idempotent \(\varphi\) and considering \(\textrm{img}(\varphi)\) instead of \(S\). The result enables the authors to answer the question in [\textit{C. Cai} et al., SIAM J. Appl. Algebra Geom. 5, No. 3, 417--454 (2021; Zbl 1477.55005)] whether a constant conqueror induces an interval in the decomposition of the associated persistence module. While a counterexample is provided to show the answer is negative, the authors prove that the result holds if the constant conqueror is replaced by a root generator.\N\NAs an application, the paper demonstrate that for a density-Rips persistent set \(S\) of a finite metric space in \(R^d\), at least \(25\%\) of the summands to be intervals in the decomposition of \(\mathcal{L}S\). This holds under very general conditions on the underlying density function, regardless of the dimension \(d\), as the number of the randomly sampled points \(n\) goes to infinity.
- Algebraic stability of zigzag persistence modules
- An O(n log n) algorithm for the all-nearest-neighbors problem
- Characterization, stability and convergence of hierarchical clustering methods
- Classifying clustering schemes
- Computational topology. An introduction
- Computing the interleaving distance is NP-hard
- Cotorsion torsion triples and the representation theory of filtered hierarchical clustering
- Decomposition of persistence modules
- Elder-rule-staircodes for augmented metric spaces
- Every 1D persistence module is a restriction of some indecomposable 2D persistence module
- Generalized persistence algorithm for decomposing multiparameter persistence modules
- scientific article; zbMATH DE number 4001209 (Why is no real title available?)
- Hyperplane restrictions of indecomposable \(n\)-dimensional persistence modules
- Mutual and shared neighbor probabilities: finite- and infinite-dimensional results
- On interval decomposability of 2D persistence modules
- On nearest-neighbor graphs
- On the bottleneck stability of rank decompositions of multi-parameter persistence modules
- On the fraction of random points by specified nearest-neighbour interrelations and degree of attraction
- On the probability that a random point is the jth nearest neighbour to its own kth nearest neighbour
- Realizations of indecomposable persistence modules of arbitrarily large dimensions
- Reflexive Nearest Neighbours
- Representations of quivers.
- Stability of 2-Parameter Persistent Homology
- The fiber of the persistence map for functions on the interval
- The theory of multidimensional persistence
- Topological analysis of scalar fields with outliers
This page was built for publication: Decomposition of zero-dimensional persistence modules via rooted subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6878300)
