复杂网络的持久同调及其动态状态检测
Persistent Homology of Complex Networks for Dynamic State Detection
摘要:
在本文中,我们开发了一种新的拓扑数据分析(TDA)的方法来研究动态系统的时间序列的图形表示。具体来说,我们展示了如何持久的同源性,从TDA的工具,可以用来产生一个压缩的,多尺度表示的图形,可以区分动态状态,如周期性和混沌行为。我们展示了从时间序列中获得的两个图形构造的方法。在第一种方法中,时间序列被嵌入到一个点云,然后用于构建一个无向$k$ -最近邻图。第二个结构依赖于最近开发的有序划分框架。在任何一种情况下,然后使用图的节点之间的最短路径来计算成对距离矩阵,并且该矩阵用于定义单纯复形的过滤,其使得能够在过滤过程中跟踪同源类的变化。这些变化总结在一个持久性图-拓扑特征变化的二维总结。然后,我们从持久性图中提取现有的以及新的几何和熵点摘要,并与其他常用的网络特征进行比较。我们的研究结果表明,基于持久性的点摘要产生更清晰的动态行为的区别,更强大的噪声比现有的基于图的分数,特别是当结合有序图。
英文摘要:
In this paper we develop a novel Topological Data Analysis (TDA) approach for studying graph representations of time series of dynamical systems. Specifically, we show how persistent homology, a tool from TDA, can be used to yield a compressed, multi-scale representation of the graph that can distinguish between dynamic states such as periodic and chaotic behavior. We show the approach for two graph constructions obtained from the time series. In the first approach the time series is embedded into a point cloud which is then used to construct an undirected $k$-nearest neighbor graph. The second construct relies on the recently developed ordinal partition framework. In either case, a pairwise distance matrix is then calculated using the shortest path between the graph's nodes, and this matrix is utilized to define a filtration of a simplicial complex that enables tracking the changes in homology classes over the course of the filtration. These changes are summarized in a persistence diagram---a two-dimensional summary of changes in the topological features. We then extract existing as well as new geometric and entropy point summaries from the persistence diagram and compare to other commonly used network characteristics. Our results show that persistence-based point summaries yield a clearer distinction of the dynamic behavior and are more robust to noise than existing graph-based scores, especially when combined with ordinal graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。