相关论文: The reflection distance between zigzag persistence…

This short note establishes explicit and broadly applicable relationships between persistence-based distances computed locally and globally. In particular, we show that the bottleneck distance between two zigzag persistence modules…

We give formulas for calculating the interleaving distance between rectangle persistence modules that depend solely on the geometry of the underlying rectangles. Moreover, we extend our results to calculate the bottleneck distance for…

We introduce two new distances for zigzag persistence modules. The first uses Auslander-Reiten quiver theory, and the second is an extension of the classical interleaving distance. Both are defined over completely general orientations of…

We study distances on zigzag persistence modules from the viewpoint of derived categories and Auslander--Reiten quivers. The derived category of ordinary persistence modules is derived equivalent to that of arbitrary zigzag persistence…

Computation of the interleaving distance between persistence modules is a central task in topological data analysis. For $1$-parameter persistence modules, thanks to the isometry theorem, this can be done by computing the bottleneck…

The pruning distance recently introduced by Bjerkevik compares persistence modules using approximate decompositions called prunings. Bjerkevik conjectures that this distance is Lipschitz equivalent to the classical interleaving distance on…

The interleaving distance was originally defined in the field of Topological Data Analysis (TDA) by Chazal et al. as a metric on the class of persistence modules parametrized over the real line. Bubenik et al. subsequently extended the…

Adapting a definition given by Bjerkevik and Lesnick for multiparameter persistence modules, we introduce an $\ell^p$-type extension of the interleaving distance on merge trees. We show that our distance is a metric, and that it…

The Isometry Theorem of Chazal et al. and Lesnick is a fundamental result in persistence theory, which states that the interleaving distance between two one-parameter persistence modules is equal to the bottleneck distance between their…

The homotopy interleaving distance, a distance between persistent spaces, was introduced by Blumberg and Lesnick and shown to be universal, in the sense that it is the largest homotopy-invariant distance for which sublevel-set filtrations…

The persistence diagram of Cohen-Steiner, Edelsbrunner, and Harer was recently generalized by Patel to the case of constructible persistence modules with values in a symmetric monoidal category with images. Patel also introduced a distance…

One of the main reasons for topological persistence being useful in data analysis is that it is backed up by a stability (isometry) property: persistence diagrams of $1$-parameter persistence modules are stable in the sense that the…

This work concerns the theoretical foundations of persistence-based topological data analysis. We develop theory of topological inference in the multidimensional persistence setting, and directly at the (topological) level of filtrations…

In 2009, Chazal et al. introduced $\epsilon$-interleavings of persistence modules. $\epsilon$-interleavings induce a pseudometric $d_I$ on (isomorphism classes of) persistence modules, the interleaving distance. The definitions of…

The algebraic stability theorem for $\mathbb{R}$-persistence modules is a fundamental result in topological data analysis. We present a stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant…

What is the distance between two points in spacetime? This is a basic geometric question, which so far has no single, definitive answer. Unlike their Riemannian cousins, Lorentzian manifolds are not known to carry a canonical distance…

The sheaf-function correspondence identifies the group of constructible functions on a real analytic manifold $M$ with the Grothendieck group of constructible sheaves on $M$. When $M$ is a finite dimensional real vector space,…

The concept of edit distance, which dates back to the 1960s in the context of comparing word strings, has since found numerous applications with various adaptations in computer science, computational biology, and applied topology. By…

We show that computing the interleaving distance between two multi-graded persistence modules is NP-hard. More precisely, we show that deciding whether two modules are $1$-interleaved is NP-complete, already for bigraded, interval…

The extended persistence diagram is an invariant of piecewise linear functions, which is known to be stable under perturbations of functions with respect to the bottleneck distance as introduced by Cohen-Steiner, Edelsbrunner, and Harer. We…