A Persistence-Driven Edit Distance for Trees with Abstract Weights
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916859474870272 |
|---|---|
| author | Pegoraro, Matteo |
| author_facet | Pegoraro, Matteo |
| contents | In this work we define a novel edit distance for trees considered with some abstract weights on the edges. The metric is driven by the idea of considering trees as topological summaries in the context of persistence and topological data analysis. Several examples related to persistent sets are presented. The metric can be computed with a dynamical binary linear programming approach. This framework is applied and further studied in other works focused on merge trees, where the problems of stability and merge trees estimation are also assessed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_12088 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A Persistence-Driven Edit Distance for Trees with Abstract Weights Pegoraro, Matteo Combinatorics Algebraic Topology In this work we define a novel edit distance for trees considered with some abstract weights on the edges. The metric is driven by the idea of considering trees as topological summaries in the context of persistence and topological data analysis. Several examples related to persistent sets are presented. The metric can be computed with a dynamical binary linear programming approach. This framework is applied and further studied in other works focused on merge trees, where the problems of stability and merge trees estimation are also assessed. |
| title | A Persistence-Driven Edit Distance for Trees with Abstract Weights |
| topic | Combinatorics Algebraic Topology |
| url | https://arxiv.org/abs/2304.12088 |