Matching distance via the extended Pareto grid
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917713665851392 |
|---|---|
| author | Frosini, Patrizio García, Eloy Mósig Quercioli, Nicola Tombari, Francesca |
| author_facet | Frosini, Patrizio García, Eloy Mósig Quercioli, Nicola Tombari, Francesca |
| contents | One of the most animated themes of multidimensional persistence is the comparison between invariants. The matching distance between persistent Betti numbers functions (or rank invariants), is among the most studied metrics in this context, particularly in 2-parameter persistence. The main reason for this interest is that, in the 2-parameter case, the foliation method allows for an effective computation of the matching distance, based on filtering the space along lines of positive slope. Our work provides a qualitative analysis, based on a construction called extended Pareto grid, of the filtering lines that actually contribute to the computation of the matching distance. Under certain genericity assumptions, we show that these lines must either be horizontal, vertical, of slope 1 or belong to a finite collection of special lines associated with discontinuity phenomena. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_04201 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Matching distance via the extended Pareto grid Frosini, Patrizio García, Eloy Mósig Quercioli, Nicola Tombari, Francesca Algebraic Topology One of the most animated themes of multidimensional persistence is the comparison between invariants. The matching distance between persistent Betti numbers functions (or rank invariants), is among the most studied metrics in this context, particularly in 2-parameter persistence. The main reason for this interest is that, in the 2-parameter case, the foliation method allows for an effective computation of the matching distance, based on filtering the space along lines of positive slope. Our work provides a qualitative analysis, based on a construction called extended Pareto grid, of the filtering lines that actually contribute to the computation of the matching distance. Under certain genericity assumptions, we show that these lines must either be horizontal, vertical, of slope 1 or belong to a finite collection of special lines associated with discontinuity phenomena. |
| title | Matching distance via the extended Pareto grid |
| topic | Algebraic Topology |
| url | https://arxiv.org/abs/2312.04201 |