arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.09549cs.CGmath.CO
收藏

$1$维(持久)路径同调的一个有效算法

An efficient algorithm for $1$-dimensional (persistent) path homology

Tamal K. Dey, Tianqi Li, Yusu Wang

摘要:

本文着重于开发一种有效的算法,从拓扑的角度分析一个有向网络(图)。这种拓扑分析的一个普遍的技术涉及计算的同源群和他们的持久性。这些概念非常适用于非定向空间。因此,我们需要一个同调的概念来适应输入空间中的方向。由Grigor'yan,Lin,Muranov和Yau为有向图开发的路同调最近被Chowdhury和Mémoli有效地用于此目的。并给出了计算这种路径同调的算法。我们在本文中的主要贡献是一个算法,计算这种路径同源性和持久性更有效的$1$维($H_1$)的情况下。在开发这样一个算法,我们发现各种结构和它们的有效计算,帮助计算的$1$维路径同伦。我们实现了我们的算法,并提出了一些初步的实验结果。

英文摘要:

This paper focuses on developing an efficient algorithm for analyzing a directed network (graph) from a topological viewpoint. A prevalent technique for such topological analysis involves computation of homology groups and their persistence. These concepts are well suited for spaces that are not directed. As a result, one needs a concept of homology that accommodates orientations in input space. Path-homology developed for directed graphs by Grigor'yan, Lin, Muranov and Yau has been effectively adapted for this purpose recently by Chowdhury and Mémoli. They also give an algorithm to compute this path-homology. Our main contribution in this paper is an algorithm that computes this path-homology and its persistence more efficiently for the $1$-dimensional ($H_1$) case. In developing such an algorithm, we discover various structures and their efficient computations that aid computing the $1$-dimensional path-homnology. We implement our algorithm and present some preliminary experimental results.

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

↑