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

arXiv2210.12868MaRDI QIDQ6414855FDOQ6414855

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

Publication date: 23 October 2022

Abstract: 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.

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Topological data analysis (62R40)

This page was built for publication: Computing the Matching Distance of 2-Parameter Persistence Modules from Critical Values

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6414855)