arXiv Analytics

Sign in

arXiv:2210.12868 [math.AT]AbstractReferencesReviewsResources

Computing the Matching Distance of 2-Parameter Persistence Modules from Critical Values

Asilata Bapat, Robyn Brooks, Celia Hacker, Claudia Landi, Barbara I. Mahler, Elizabeth R. Stephenson

Published 2022-10-23Version 1

The exact computation of the matching distance for multi-parameter persistence modules is an active area of research in computational topology. Achieving an easily obtainable exact computation of this distance would allow multi-parameter persistent homology to be a viable option for data analysis. In this paper, we provide theoretical results for the computation of the matching distance in two dimensions along with a geometric interpretation of the lines through parameter space realizing this distance. The crucial point of the method we propose is that it can be easily implemented.

Comments: 28 pages, 6 figures. Comments welcome
Categories: math.AT, cs.CG
Subjects: 55N31, 62R40
Related articles: Most relevant | Search more
arXiv:2206.08818 [math.AT] (Published 2022-06-17)
Projected distances for multi-parameter persistence modules
arXiv:2210.16718 [math.AT] (Published 2022-10-30)
Geometry of the matching distance for 2D filtering functions
arXiv:1812.08580 [math.AT] (Published 2018-12-20)
Chunk Reduction for Multi-Parameter Persistent Homology