Metraipolis › archive › dc_08b6937092de
Beyond the Lower-Star Filtration: Alternative Filtration Methods for Persistent Homology — arXiv:2611.08833
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.08833
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:41:51.216Z
- SHA-256 of the archived text
1176df01ae74ba056ac51405a7b7916d0f57f008d4af67078a25b68d4e56aebd- Stable URL of this page
https://metraipolis.com/documento/dc_08b6937092de
How to cite
Beyond the Lower-Star Filtration: Alternative Filtration Methods for Persistent Homology — arXiv:2611.08833 — arXiv (en), https://arxiv.org/abs/2611.08833 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_08b6937092de (Metraipolis archive dc_08b6937092de, sha256 1176df01ae74ba056ac51405a7b7916d0f57f008d4af67078a25b68d4e56aebd)
BibTeX
@misc{dc08b6937092de,
title = {Beyond the Lower-Star Filtration: Alternative Filtration Methods for Persistent Homology — arXiv:2611.08833},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.08833},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_08b6937092de; sha256 1176df01ae74ba056ac51405a7b7916d0f57f008d4af67078a25b68d4e56aebd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08833. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In the lower-star filtration (LSF), simplices are assigned filtration values according to the maximum-vertex rule, with each simplex entering the filtration when its highest-valued vertex appears. A limitation of this construction is that some higher-dimensional simplices may enter simultaneously with their boundary faces, causing certain topological features to be filled immediately upon formation and thus not appear in the resulting persistence diagram. To address this limitation, we propose three alternative filtration methods: the \(\varepsilon\)-lower-star filtration (ELSF), the \(L_p\) filtration (LpF), and the softmax filtration (SMF). {ELSF introduces a dimension-dependent delay to the maximum-vertex rule,} allowing higher-dimensional simplices to enter the filtration after their boundary faces, whereas {LpF and SMF use aggregation functions that depend on all vertex values rather} than solely on their maximum. By modifying how filtration values are assigned, these methods allow simplices to enter the filtration more progressively, so that topological features such as loops and voids may persist over longer filtration intervals rather than being filled immediately. Consequently, the resulting persistence diagrams may include persistence features that are not observed under LSF, potentially providing useful information for distinguishing data populations. Experimental results on simulated and real-world datasets demonstrate that the proposed filtration methods are computationally efficient and can provide greater sensitivity to structural differences in the data than LSF.
Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG); Algebraic Topology (math.AT); Applications (stat.AP).
Pagina del lavoro: https://arxiv.org/abs/2611.08833 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-09T22:33:47.171Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).