arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.03902math.AT
收藏

持续 Laplacian 的代数稳定性

The algebraic stability for persistent Laplacians

Jian Liu, Jingyan Li, Jie Wu

AI总结:

本文研究了持续 Laplacian 的稳定性,通过引入“Laplacian 树”概念并构建其范畴,建立了持续 Laplacian 树的代数稳定性定理,该定理适用于单纯复形和有向图上的实值函数。

摘要:

拓扑持久性的稳定性是拓扑数据分析的基本问题之一。已有许多方法被提出以解决持续模或持续图的稳定性问题。近期,持续 Laplacian 的概念作为一种拓扑持久性的新方法出现,引起了广泛关注并在各个领域得到应用。在本文中,我们研究了持续 Laplacian 的稳定性。我们引入了“Laplacian 树”的概念,用于捕捉从给定参数持续的持续 Laplacian 的集合。为了形式化我们的研究,我们构建了 Laplacian 树的范畴,并为持续 Laplacian 树建立了一个代数稳定性定理。值得注意的是,我们的稳定性定理被应用于单纯复形和有向图上的实值函数。

英文摘要:

The stability of topological persistence is one of the fundamental issues in topological data analysis. Numerous methods have been proposed to address the stability of persistent modules or persistence diagrams. Recently, the concept of persistent Laplacians has emerged as a novel approach to topological persistence, attracting significant attention and finding applications in various fields. In this paper, we investigate the stability of persistent Laplacians. We introduce the notion of ``Laplacian trees'', which captures the collection of persistent Laplacians that persist from a given parameter. To formalize our study, we construct the category of Laplacian trees and establish an algebraic stability theorem for persistent Laplacian trees. Notably, our stability theorem is applied to the real-valued functions on simplicial complexes and digraphs.

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

↑