Decomposition of zero-dimensional persistence modules via rooted subsets
From MaRDI portal
Cites work
- 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)
