arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1506.09103physics.data-anmath.DS
收藏

混沌序列的TQ复杂度估计

Estimation of the TQ-complexity of chaotic sequences

A. V. Makarenko

摘要:

本文提出了一种新的方法,根据多维离散序列在扩展状态空间中的轨迹形状,定量地估计其复杂性。该方法基于对序列结构性质的研究,适用于混沌序列和随机序列的复杂度估计。它是建立在作者早先提出的多维离散序列和映射的符号CTQ分析的方法上的。所提出的算法不仅操纵符号出现的频率,而且还考虑到它们的序列顺序。一个例子(金融时间序列),演示了开发的工具的应用。

英文摘要:

A new approach is proposed to the quantitative estimation of the complexity of multidimensional discrete sequences in terms of the shapes of their trajectories in the extended space of states. This approach is based on the study of the structural properties of sequences and is suitable for estimating the complexity of both chaotic and stochastic sequences. It is constructed on the method, proposed earlier by the author, of symbolic CTQ-analysis of multidimensional discrete sequences and mappings. The algorithm proposed manipulates not only the frequency of occurrence of symbols, but also takes into account their sequence order. An example (financial time series) is given that demonstrates the application of the tools developed.

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

↑