时间序列网络图复杂性的一种单纯形方法
Characterizing the complexity of time series network graphs: A simplicial approach
摘要:
我们分析的时间序列从不同的动力学制度的Logistic映射通过构建其等价的时间序列(TS)网络,使用可见性算法。所分析的区域包括周期区域和混沌区域,以及间歇区域和混沌边缘的Feigenbaum吸引子。我们使用代数拓扑学的方法来定义单纯特征,它可以分析网络的单纯结构的全局和局部水平。单纯的特征带来了复杂性的层次在不同的拓扑水平。这些层次的复杂性找到嵌入在网络中的局部动态的骨架,影响系统的全局动态特性,也允许识别占主导地位的图案。我们还分析了相同的网络使用传统的网络特征,如平均路径长度和聚类系数。我们看到,单纯的特征能够区分不同的动力学制度,可以拿起微妙的差异,动力学行为,而通常的特征提供了一个粗糙的表征。然而,两者结合起来,可以提供有关时间序列的动力学行为以及演化系统中的相关性的信息。因此,我们的方法可以为动力系统的分析提供强大的工具。
英文摘要:
We analyze the time series obtained from different dynamical regimes of the logistic map by constructing their equivalent time series (TS) networks, using the visibility algorithm. The regimes analyzed include both periodic and chaotic regimes, as well as intermittent regimes and the Feigenbaum attractor at the edge of chaos. We use the methods of algebraic topology to define the simplicial characterizers, which can analyse the simplicial structure of the networks at both the global and local levels. The simplicial characterisers bring out the hierarchical levels of complexity at various topological levels. These hierarchical levels of complexity find the skeleton of the local dynamics embedded in the network which influence the global dynamical properties of the system, and also permit the identification of dominant motifs. We also analyze the same networks using conventional network characterizers such as average path lengths and clustering coefficients. We see that the simplicial characterizers are capable of distinguishing between different dynamical regimes and can pick up subtle differences in dynamical behavior, whereas the usual characterizers provide a coarser characterization. However, the two taken in conjunction, can provide information about the dynamical behavior of the time series, as well as the correlations in the evolving system. Our methods can therefore provide powerful tools for the analysis of dynamical systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。