arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.13728physics.data-an
收藏

随机过程的广义置换熵

A generalized permutation entropy for random processes

José M. Amigó, Roberto Dale, Piergiulio Tempesta

摘要:

排列熵通过由称为有序模式或排列的秩向量组成的数据符号量化来度量确定性时间序列的复杂性。这种熵在时间序列分析中越来越受欢迎的原因包括:(i)它在更长排列的限制下收敛于潜在动力学的Kolmogorov-Sinai熵,以及(ii)它的计算无需生成和特别分区。然而,当允许的排列的数量随着它们的长度超指数增长时,排列熵发散,就像通常由随机过程输出的时间序列一样。在这封信中,我们提出了一个广义置换熵是有限的随机过程,包括离散时间动态系统的观测或动态噪声。

英文摘要:

Permutation entropy measures the complexity of deterministic time series via a data symbolic quantization consisting of rank vectors called ordinal patterns or just permutations. The reasons for the increasing popularity of this entropy in time series analysis include that (i) it converges to the Kolmogorov-Sinai entropy of the underlying dynamics in the limit of ever longer permutations, and (ii) its computation dispenses with generating and ad hoc partitions. However, permutation entropy diverges when the number of allowed permutations grows super-exponentially with their length, as is usually the case when time series are output by random processes. In this Letter we propose a generalized permutation entropy that is finite for random processes, including discrete-time dynamical systems with observational or dynamical noise.

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

↑