Pruning vineyards: updating barcodes and representative cycles by removing simplices
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917384205369344 |
|---|---|
| author | Giunti, Barbara Lazovskis, Jānis |
| author_facet | Giunti, Barbara Lazovskis, Jānis |
| contents | The barcode of a filtration and its representative cycles encode rich information often useful in data analysis. However, obtaining them can be computationally expensive. Therefore, it is useful to have methods that update them if the associated filtration undergoes small changes. There are already efficient algorithms updating a barcode if simplices exchange entrance order or are added, but not if simplices are removed. We provide an implementation to update a reduced boundary matrix when simplices in the filtration are removed. Our algorithm, the Simplicial Removal Update Procedure (SiRUP), intrinsically updates also the representative cycles, and is compatible with the clearing optimizations. We show that the complexity of our algorithm is lower than recomputing the barcode from scratch and that the number of executed matrix column additions is minimal, with both theoretical and experimental methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_03925 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Pruning vineyards: updating barcodes and representative cycles by removing simplices Giunti, Barbara Lazovskis, Jānis Algebraic Topology Computational Geometry 55N31 (Primary) 15-04, 68Q25 (Secondary) The barcode of a filtration and its representative cycles encode rich information often useful in data analysis. However, obtaining them can be computationally expensive. Therefore, it is useful to have methods that update them if the associated filtration undergoes small changes. There are already efficient algorithms updating a barcode if simplices exchange entrance order or are added, but not if simplices are removed. We provide an implementation to update a reduced boundary matrix when simplices in the filtration are removed. Our algorithm, the Simplicial Removal Update Procedure (SiRUP), intrinsically updates also the representative cycles, and is compatible with the clearing optimizations. We show that the complexity of our algorithm is lower than recomputing the barcode from scratch and that the number of executed matrix column additions is minimal, with both theoretical and experimental methods. |
| title | Pruning vineyards: updating barcodes and representative cycles by removing simplices |
| topic | Algebraic Topology Computational Geometry 55N31 (Primary) 15-04, 68Q25 (Secondary) |
| url | https://arxiv.org/abs/2312.03925 |