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

12/21/2018
by   Michael Kerber, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/23/2022

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

The exact computation of the matching distance for multi-parameter persi...
research
08/17/2021

Rectangular Approximation and Stability of 2-parameter Persistence Modules

One of the main reasons for topological persistence being useful in data...
research
03/07/2018

Computing Bottleneck Distance for 2-D Interval Decomposable Modules

Computation of the interleaving distance between persistence modules is ...
research
11/19/2021

Asymptotic Improvements on the Exact Matching Distance for 2-parameter Persistence

In the field of topological data analysis, persistence modules are used ...
research
12/22/2021

On the stability of multigraded Betti numbers and Hilbert functions

Multigraded Betti numbers are one of the simplest invariants of multipar...
research
12/12/2019

Efficient Approximation of the Matching Distance for 2-parameter persistence

The matching distance is a computationally tractable topological measure...
research
05/28/2018

The reflection distance between zigzag persistence modules

By invoking the reflection functors introduced by Bernstein, Gelfand, an...

Please sign up or login with your details

Forgot password? Click here to reset