Exact computation of the matching distance on 2-parameter persistence modules - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Exact computation of the matching distance on 2-parameter persistence modules

Michael Lesnick
  • Function : Author
  • PersonId : 1041087
Steve Oudot
  • Function : Author
  • PersonId : 845393

Abstract

The matching distance is a pseudometric on multi-parameter persistence modules, defined in terms of the weighted bottleneck distance on the restriction of the modules to affine lines. It is known that this distance is stable in a reasonable sense, and can be efficiently approximated, which makes it a promising tool for practical applications. In this work, we show that in the 2-parameter setting, the matching distance can be computed exactly in polynomial time. Our approach subdivides the space of affine lines into regions, via a line arrangement. In each region, the matching distance restricts to a simple analytic function, whose maximum is easily computed. As a byproduct, our analysis establishes that the matching distance is a rational number, if the bigrades of the input modules are rational.
Fichier principal
Vignette du fichier
p.pdf (489.86 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01966666 , version 1 (21-02-2019)

Identifiers

Cite

Michael Kerber, Michael Lesnick, Steve Oudot. Exact computation of the matching distance on 2-parameter persistence modules. SoCG 2019 - International Symposium on Computational Geometry, Jun 2019, Portland, Oregon, United States. ⟨hal-01966666⟩
84 View
89 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More