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

持久有向旗形拉普拉斯算子

Persistent Directed Flag Laplacian

Benjamin Jones, Guowei Wei

AI总结:

本文将持久拓扑拉普拉斯算子扩展到有向旗形复形,提出持久有向旗形拉普拉斯算子(PDFL),并通过示例计算展示其在实际应用中的潜力。

摘要:

在过去十年中,拓扑数据分析(TDA)在科学与工程领域取得了巨大成功。持久拓扑拉普拉斯算子(PTLs)克服了持久同调这一TDA关键技术的某些局限性,并为各种几何与拓扑对象的行为提供了重要洞察。本工作将PTLs扩展到有向旗形复形,这是对旗形复形(也称为团复形)的一种令人兴奋的推广,在许多情形中自然出现。我们引入了有向旗形拉普拉斯算子,并证明所提出的持久有向旗形拉普拉斯算子(PDFL)是分析这些旗形复形的一种独特方法。文中提供了示例计算,以展示所提出的PDFL在实际应用中的潜力。

英文摘要:

Topological data analysis (TDA) has had enormous success in science and engineering in the past decade. Persistent topological Laplacians (PTLs) overcome some limitations of persistent homology, a key technique in TDA, and provide substantial insight to the behavior of various geometric and topological objects. This work extends PTLs to directed flag complexes, which are an exciting generalization to flag complexes, also known as clique complexes, that arise naturally in many situations. We introduce the directed flag Laplacian and show that the proposed persistent directed flag Laplacian (PDFL) is a distinct way of analyzing these flag complexes. Example calculations are provided to demonstrate the potential of the proposed PDFL in real world applications.

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

↑