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

doi:10.48550/arXiv.2210.12868

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

Mathematical Sciences Institute

Research output: Contribution to journal › Article

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.

Original language	English
Article number	2210.12868
Number of pages	28
Journal	arXiv e-prints
DOIs	https://doi.org/10.48550/arXiv.2210.12868
Publication status	Published - 23 Oct 2022

Access to Document

10.48550/arXiv.2210.12868

https://arxiv.org/abs/2210.12868

Cite this

@article{e8c38e81487d43c0a976e31fbeafd9d2,

title = "Computing the Matching Distance of 2-Parameter Persistence Modules from Critical Values",

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.",

author = "Asilata Bapat and Robyn Brooks and Celia Hacker and Claudia Landi and Mahler, \{Barbara I.\} and Stephenson, \{Elizabeth R.\}",

year = "2022",

month = oct,

day = "23",

doi = "10.48550/arXiv.2210.12868",

language = "English",

journal = "arXiv e-prints",

publisher = "Cornell University",

}

TY - JOUR

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

AU - Bapat, Asilata

AU - Brooks, Robyn

AU - Hacker, Celia

AU - Landi, Claudia

AU - Mahler, Barbara I.

AU - Stephenson, Elizabeth R.

PY - 2022/10/23

Y1 - 2022/10/23

N2 - 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.

AB - 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.

U2 - 10.48550/arXiv.2210.12868

DO - 10.48550/arXiv.2210.12868

M3 - Article

JO - arXiv e-prints

JF - arXiv e-prints

M1 - 2210.12868

ER -

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

Abstract

Access to Document

Fingerprint

Cite this