arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1203.6786cs.CGcs.DS
收藏

Vietoris-Rips过滤的线性尺寸近似

Linear-Size Approximations to the Vietoris-Rips Filtration

Donald R. Sheehy

摘要:

Vietoris-Rips滤波是拓扑数据分析中的一个通用工具。它是建立在度量空间上的单纯复形序列,用于将拓扑结构添加到否则不连通的点集。它被广泛使用,因为它编码了关于底层度量空间拓扑的有用信息。这些信息通常是从所谓的持久性图中提取的。不幸的是,这种过滤通常太大而无法完全构建。我们展示了如何在$n$ -点度量空间上构造一个O(n)大小的过滤单纯复形,使得它的持久性图是Vietoris-Rips过滤的一个很好的近似.这种新的过滤可以在$O(n\log n)$时间内构建。在规模和运行时间的常数因子仅取决于度量空间的双倍维数和所需的近似紧度。这是第一次,这使得它在计算上易于处理,以近似的持久性图的Vietoris-Rips过滤在所有规模的大型数据集。我们描述了两种不同的稀疏滤波。第一种是锯齿形过滤,随着比例的增加而删除点。第二个是一个(非锯齿形)过滤,产生相同的持久性图。这两种方法都是基于层次网络树,并产生相同的保证。

英文摘要:

The Vietoris-Rips filtration is a versatile tool in topological data analysis. It is a sequence of simplicial complexes built on a metric space to add topological structure to an otherwise disconnected set of points. It is widely used because it encodes useful information about the topology of the underlying metric space. This information is often extracted from its so-called persistence diagram. Unfortunately, this filtration is often too large to construct in full. We show how to construct an O(n)-size filtered simplicial complex on an $n$-point metric space such that its persistence diagram is a good approximation to that of the Vietoris-Rips filtration. This new filtration can be constructed in $O(n\log n)$ time. The constant factors in both the size and the running time depend only on the doubling dimension of the metric space and the desired tightness of the approximation. For the first time, this makes it computationally tractable to approximate the persistence diagram of the Vietoris-Rips filtration across all scales for large data sets. We describe two different sparse filtrations. The first is a zigzag filtration that removes points as the scale increases. The second is a (non-zigzag) filtration that yields the same persistence diagram. Both methods are based on a hierarchical net-tree and yield the same guarantees.

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

↑