arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.01834math.ATcs.CG
收藏

扩展持续性的通用距离

Universal Distances for Extended Persistence

Ulrich Bauer, Magnus Bakke Botnan, Benedikt Fluhr

AI总结:

本文研究扩展持续性图的通用距离问题,证明瓶颈距离的一个更具判别力的变体是通用的,并证明实数轴上层的交错距离及 Reeb 图的交错距离均非内在距离。

摘要:

扩展持续性图是分段线性函数的一个不变量,已知其在 Cohen-Steiner、Edelsbrunner 和 Harer 引入的瓶颈距离下对函数扰动具有稳定性。我们研究通用性问题,即寻找扩展持续性图上最大可能的稳定距离,并证明瓶颈距离的一个更具判别力的变体是通用的。我们的结果更广泛地适用于持续性图仅被考虑到某一特定程度的情形。我们通过建立相对层间集同调的函子构造和若干特征性质来得到这些结果,这些性质与经典的 Eilenberg--Steenrod 公理相对应。最后,我们通过证明实数轴上层的交错距离不是内在的,更不用说通用,来将瓶颈距离与层的交错距离进行对比。这一特定结果进一步意味着 Reeb 图的交错距离也不是内在的。

英文摘要:

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 address the question of universality, which asks for the largest possible stable distance on extended persistence diagrams, showing that a more discriminative variant of the bottleneck distance is universal. Our result applies more generally to settings where persistence diagrams are considered only up to a certain degree. We achieve our results by establishing a functorial construction and several characteristic properties of relative interlevel set homology, which mirror the classical Eilenberg--Steenrod axioms. Finally, we contrast the bottleneck distance with the interleaving distance of sheaves on the real line by showing that the latter is not intrinsic, let alone universal. This particular result has the further implication that the interleaving distance of Reeb graphs is not intrinsic either.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑