The Theory of the Interleaving Distance on Multidimensional Persistence Modules
Michael Lesnick

TL;DR
This paper develops the theory of the interleaving distance for multidimensional persistence modules, establishing its properties, universality, and relation to the bottleneck distance, with implications for topological data analysis.
Contribution
It extends the interleaving distance theory to multidimensional modules, proves its universality, and relates it to the bottleneck distance, advancing topological data analysis tools.
Findings
$d_I$ equals the bottleneck distance $d_B$ on 1-D modules.
Characterization of $ extepsilon$-interleavings for multidimensional modules.
$d_I$ satisfies a universality property among stable pseudometrics.
Abstract
In 2009, Chazal et al. introduced -interleavings of persistence modules. -interleavings induce a pseudometric on (isomorphism classes of) persistence modules, the interleaving distance. The definitions of -interleavings and generalize readily to multidimensional persistence modules. In this paper, we develop the theory of multidimensional interleavings, with a view towards applications to topological data analysis. We present four main results. First, we show that on 1-D persistence modules, is equal to the bottleneck distance . This result, which first appeared in an earlier preprint of this paper, has since appeared in several other places, and is now known as the isometry theorem. Second, we present a characterization of the -interleaving relation on multidimensional persistence modules. This expresses transparently the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
