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

非分支复形的持续拉普拉斯算子

The persistent Laplacian of non-branching complexes

Magnus Bakke Botnan, Rui Dong

AI总结:

本文研究非分支矩阵与非分支复形的持续拉普拉斯算子,给出近线性核基与上持续拉普拉斯计算方法,并建立超图表示、Kron 约化推广及 Cheeger 型不等式。

摘要:

非分支矩阵是元素属于 {-1,0,1} 的实矩阵,其中每行至多包含两个非零元素。此类矩阵自然出现在伪流形和立方复形的拉普拉斯算子研究中。我们证明,非分支矩阵的核的一组基可以在近线性时间内计算。特别地,该基具有一个特殊性质:其中所有列向量的支集彼此不交。基于这一结果,我们证明对于一对此类空间,上持续拉普拉斯算子可以在近线性时间内计算,并且其特征值可以通过计算奇异值而更高效地得到。除此之外,我们分析了关于非分支滤流的上持续拉普拉斯算子的算术运算。此外,我们证明 q-非分支单纯复形的上持续拉普拉斯算子可以表示为一个关联超图的拉普拉斯算子,从而提供了 Kron 约化的高维推广以及一个 Cheeger 型不等式。最后,我们在图像数据上展示了本方法的效率。

英文摘要:

Non-branching matrices are real matrices with entries in $\{-1,0,1\}$, where each row contains at most two non-zero entries. Such matrices naturally arise in the study of Laplacians of pseudomanifolds and cubical complexes. We show that a basis for the kernel of a non-branching matrix can be computed in near-linear time. Especially, the basis has the special property that the supports of all the column vectors in it are disjoint with each other. Building on this result, we show that the up persistent Laplacian can be computed in near-linear time for a pair of such spaces and its eigenvalues can be more efficiently computed via computing singular values. In addition to that, we analyze the arithmetic operations of up persistent Laplacian with respect to a non-branching filtration. Furthermore, we show that the up persistent Laplacian of $q$-non-branching simplicial complexes can be represented as the Laplacian of an associated hypergraph, thus providing a higher-dimensional generalization of the Kron reduction, as well as a Cheeger-type inequality. Finally, we highlight the efficiency of our method on image data.

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

↑