Computational Complexity of the Interleaving Distance
Abstract
The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings. We show that the interleaving distance is NP-hard to compute for persistence modules valued in the category of vector spaces. In the specific setting of multidimensional persistent homology we show that the problem is at least as hard as a matrix invertibility problem. Furthermore, this allows us to conclude that the interleaving distance of interval decomposable modules depends on the characteristic of the field. Persistence modules valued in the category of sets are also studied. As a corollary, we obtain that the isomorphism problem for Reeb graphs is graph isomorphism complete.
Cite
@article{arxiv.1712.04281,
title = {Computational Complexity of the Interleaving Distance},
author = {Håvard Bakke Bjerkevik and Magnus Bakke Botnan},
journal= {arXiv preprint arXiv:1712.04281},
year = {2018}
}
Comments
Discussion related to the characteristic of the field added. Paper accepted to the 34th International Symposium on Computational Geometry