Kolmogorov-Sinai entropy from recurrence times

Observing how long a dynamical system takes to return to some state is one of the most simple ways to model and quantify its dynamics from data series. This work proposes two formulas to estimate the KS entropy and a lower bound of it, a sort of Shannon's entropy per unit of time, from the recurrence times of chaotic systems. One formula provides the KS entropy and is more theoretically oriented since one has to measure also the low probable very long returns. The other provides a lower bound for the KS entropy and is more experimentally oriented since one has to measure only the high probable short returns. These formulas are a consequence of the fact that the series of returns do contain the same information of the trajectory that generated it. That suggests that recurrence times might be valuable when making models of complex systems.     

Attractors of convex maps with positive Schwarzian derivative in the presence of noise

One-dimensional maps have proved to be useful models for understanding the transition to turbulence. We investigate a smooth perturbation of the well-known logistic system in order to examine numerically the change in the bifurcation behavior which is observed, when the Schwarzian derivative is allowed to become positive. We find coexistence of a fixed point attractor and a periodic or chaotic two-band-attractor. The chaotic two-band attractor can disappear by yielding a preturbulent state which will asymptotically settle down to a fixed-point. The chaotic behavior of some systems can be destroyed by arbitrarily small amounts of external noise. The concept of (ε, δ)-diffusions is used to describe the sensitivity of attractors against external noise. We also observe a direct transition from a fixed-point to a chaotic one-band attractor. This can be interpreted as type-III-intermittency of Pomeau and Manneville but with an almost linear scaling behavior of the Lyapunov exponent.     

一种基于非完整二维相空间分量置换的混沌检测方法

由于混沌时间序列和随机过程具有很多类似的性质, 因而在实际中很难将两者区分开来. 混沌信号检测与识别是混沌时间序列分析中一个重要的课题. 混沌信号是由确定性的混沌映射或混沌系统产生的, 相比于高斯白噪声序列, 其在非完整的二维相空间中表现出更加丰富的结构特性. 本文通过研究混沌时间序列和高斯白噪声序列在非完整二维相空间中的分布特性, 利用混沌信号的非线性动力学特性, 提出了一种基于非完整二维相空间分量置换的混沌信号检测方法. 该方法首先由接收序列得到非完整的二维相空间, 基于第一维分量大小关系实现对第二维分量的置换与分组, 进一步求得F检验统计量. 然后利用混沌系统的局部特性, 获取非完整二维相空间的动力学结构信息, 实现对混沌序列的有效检测. 在高斯白噪声条件下对多种混沌信号进行了信号检测的数值仿真. 仿真结果表明: 相比置换熵检测, 本文所提算法所需数据量小、计算简单以及具有更低的时间复杂度, 同时对噪声具有更好的鲁棒性.     

Quantifying information loss on chaotic attractors through recurrence networks

We propose an entropy measure for the analysis of chaotic attractors through recurrence networks which are un-weighted and un-directed complex networks constructed from time series of dynamical systems using specific criteria. We show that the proposed measure converges to a constant value with increase in the number of data points on the attractor (or the number of nodes on the network) and the embedding dimension used for the construction of the network, and clearly distinguishes between the recurrence network from chaotic time series and white noise. Since the measure is characteristic to the network topology, it can be used to quantify the information loss associated with the structural change of a chaotic attractor in terms of the difference in the link density of the corresponding recurrence networks. We also indicate some practical applications of the proposed measure in the recurrence analysis of chaotic attractors as well as the relevance of the proposed measure in the context of the general theory of complex networks.     

混沌信号自适应协同滤波去噪

混沌信号协同滤波去噪算法充分利用了混沌信号的自相似结构特征,具有良好的信噪比提升性能.针对该算法的滤波参数优化问题,考虑到最优滤波参数的选取受到信号特征、采样频率和噪声水平的影响,为提高该算法的自适应性使其更符合实际应用需求,基于排列熵提出一种滤波参数自动优化准则.依据不同噪声水平的混沌信号排列熵的不同,首先选取不同滤波参数对含噪混沌信号进行去噪,然后计算各滤波参数对应重构信号的排列熵,最后通过比较各重构信号的排列熵,选取排列熵最小的重构信号对应的滤波参数为最优滤波参数,实现滤波参数的优化.分析了不同信号特征、采样频率和噪声水平情况下滤波参数的选取规律.仿真结果表明,该参数优化准则能在不同条件下对滤波参数进行有效的自动最优化,提高了混沌信号协同滤波去噪算法的自适应性.     

Permutation Entropy of Weakly Noise-Affected Signals

We analyze the permutation entropy of deterministic chaotic signals affected by a weak observational noise. We investigate the scaling dependence of the entropy increase on both the noise amplitude and the window length used to encode the time series. In order to shed light on the scenario, we perform a multifractal analysis, which allows highlighting the emergence of many poorly populated symbolic sequences generated by the stochastic fluctuations. We finally make use of this information to reconstruct the noiseless permutation entropy. While this approach works quite well for Hénon and tent maps, it is much less effective in the case of hyperchaos. We argue about the underlying motivations.     

A Method for Estimating the Entropy of Time Series Using Artificial Neural Networks

Measuring the predictability and complexity of time series using entropy is essential tool designing and controlling a nonlinear system. However, the existing methods have some drawbacks related to the strong dependence of entropy on the parameters of the methods. To overcome these difficulties, this study proposes a new method for estimating the entropy of a time series using the LogNNet neural network model. The LogNNet reservoir matrix is filled with time series elements according to our algorithm. The accuracy of the classification of images from the MNIST-10 database is considered as the entropy measure and denoted by NNetEn. The novelty of entropy calculation is that the time series is involved in mixing the input information in the reservoir. Greater complexity in the time series leads to a higher classification accuracy and higher NNetEn values. We introduce a new time series characteristic called time series learning inertia that determines the learning rate of the neural network. The robustness and efficiency of the method is verified on chaotic, periodic, random, binary, and constant time series. The comparison of NNetEn with other methods of entropy estimation demonstrates that our method is more robust and accurate and can be widely used in practice.     

Unstable periodic orbits and noise in chaos computing

Different methods to utilize the rich library of patterns and behaviors of a chaotic system have been proposed for doing computation or communication. Since a chaotic system is intrinsically unstable and its nearby orbits diverge exponentially from each other, special attention needs to be paid to the robustness against noise of chaos-based approaches to computation. In this paper unstable periodic orbits, which form the skeleton of any chaotic system, are employed to build a model for the chaotic system to measure the sensitivity of each orbit to noise, and to select the orbits whose symbolic representations are relatively robust against the existence of noise. Furthermore, since unstable periodic orbits are extractable from time series, periodic orbit-based models can be extracted from time series too. Chaos computing can be and has been implemented on different platforms, including biological systems. In biology noise is always present; as a result having a clear model for the effects of noise on any given biological implementation has profound importance. Also, since in biology it is hard to obtain exact dynamical equations of the system under study, the time series techniques we introduce here are of critical importance.     

On entropy, financial markets and minority games

The paper builds upon an earlier statistical analysis of financial time series with Shannon information entropy, published in [L. Molgedey, W. Ebeling, Local order, entropy and predictability of financial time series, European Physical Journal B—Condensed Matter and Complex Systems 15/4 (2000) 733-737]. A novel generic procedure is proposed for making multistep-ahead predictions of time series by building a statistical model of entropy. The approach is first demonstrated on the chaotic Mackey-Glass time series and later applied to Japanese Yen/US dollar intraday currency data. The paper also reinterprets Minority Games [E. Moro, The minority game: An introductory guide, Advances in Condensed Matter and Statistical Physics (2004)] within the context of physical entropy, and uses models derived from minority game theory as a tool for measuring the entropy of a model in response to time series. This entropy conditional upon a model is subsequently used in place of information-theoretic entropy in the proposed multistep prediction algorithm.     

摇摆条件下自然循环系统流量混沌脉动的检验与预测

利用替代数据法检验了摇摆条件下自然循环系统不规则复合型脉动的混沌特性, 并在此基础上进行混沌预测. 关联维数、最大Lyapunov指数等几何不变量计算结果表明不规则复合型脉动具有混沌特性, 但是由于计算结果受实验时间序列长度的限制和噪声的影响, 可能会出现错误的判断结果. 为了避免出现误判, 在提取流量脉动的非线性特征的同时, 需要用替代数据法进一步检验混沌特性是否来自于确定性的非线性系统. 本文用迭代的幅度调节Fourier 算法进行混沌检验, 在此基础上用加权一阶局域法进行混沌脉动的预测. 计算结果表明: 不规则复合型脉动是来自于确定性系统的混沌脉动, 加权一阶局域法对流量脉动进行混沌预测效果较好, 并提出动态预测方法. 关键词： 混沌时间序列 替代数据法 实时预测 两相流动不稳定性     

Detecting dynamical complexity changes in time series using the base-scale entropy

Timely detection of dynamical complexity changes in natural and man-made systems has deep scientific and practical meanings. We introduce a complexity measure for time series： the base-scale entropy. The definition directly applies to arbitrary real-word data. We illustrate our method on a practical speech signal and in a theoretical chaotic system. The results show that the simple and easily calculated measure of base-scale entropy can be effectively used to detect qualitative and quantitative dynamical changes.     

Rescaled Range Permutation Entropy: A Method for Quantifying the Dynamical Complexity of Extreme Volatility in Chaotic Time Series

Information entropy,as a quantitative measure of complexity in nonlinear systems,has been widely researched in a variety of contexts.With the development of a nonlinear dynamic,the entropy is faced with severe challenges in dealing with those signals exhibiting extreme volatility.In order to address this problem of weighted permutation entropy,which may result in the inaccurate estimation of extreme volatility,we propose a rescaled range permutation entropy,which selects the ratio of range and standard deviation as the weight of different fragments in the time series,thereby effectively extracting the maximum volatility.By analyzing typical nonlinear systems,we investigate the sensitivities of four methods in chaotic time series where extreme volatility occurs.Compared with sample entropy,fuzzy entropy,and weighted permutation entropy,this rescaled range permutation entropy leads to a significant discernibility,which provides a new method for distinguishing the complexity of nonlinear systems with extreme volatility.     

Synchronization in a Mutualism Ecosystem Induced by Noise Correlation

Understanding the cause of the synchronization of population evolution is an important issue for ecological improvement. Here we present a Lotka-Volterra-type model driven by two correlated environmental noises and show, via theoretical analysis and direct simulation, that noise correlation can induce a synchronization of the mutualists. The time series of mutual species exhibit a chaotic-like fluctuation, which is independent of the noise correlation, however, the chaotic fluctuation of mutual species ratio decreases with the noise correlation. A quantitative parameter defined for characterizing chaotic fluctuation provides a good approach to measure when the complete synchronization happens.     

Studying hyperbolicity in chaotic systems

On the basis of method [1] proposed for diagnosing 2-dimensional chaotic saddles we present a numerical procedure to distinguish hyperbolic and nonhyperbolic chaotic attractors in three-dimensional flow systems. This technique is based on calculating the angles between stable and unstable manifolds along a chaotic trajectory in R³. We show for three-dimensional flow systems that this serves as an efficient characteristic for exploring chaotic differential systems. We also analyze the effect of noise on the structure of angle distribution for both 2-dimensional invertible maps and a 3-dimensional continuous system.     

A method of estimating the noise level in a chaotic time series

An attempt is made in this study to estimate the noise level present in a chaotic time series. This is achieved by employing a linear least-squares method that is based on the correlation integral form obtained by Diks in 1999. The effectiveness of the method is demonstrated using five artificial chaotic time series, the Henon map, the Lorenz equation, the Duffing equation, the Rossler equation and the Chua's circuit whose dynamical characteristics are known a priori. Different levels of noise are added to the artificial chaotic time series and the estimated results indicate good performance of the proposed method. Finally, the proposed method is applied to estimate the noise level present in some real world data sets.     

Modified multiscale entropy for short-term time series analysis

Multiscale entropy (MSE) is a prevalent algorithm used to measure the complexity of a time series. Because the coarse-graining procedure reduces the length of a time series, the conventional MSE algorithm applied to a short-term time series may yield an imprecise estimation of entropy or induce undefined entropy. To overcome this obstacle, the modified multiscale entropy (MMSE) was developed. The coarse-graining procedure was replaced with a moving-average procedure and a time delay was incorporated for constructing template vectors in calculating sample entropy. For conducting short-term time series analysis, this study shows that the MMSE algorithm is more reliable than the conventional MSE.     

短时交通流复杂动力学特性分析及预测

为揭示短时交通流的内在动态特性,利用非线性方法对交通流混沌特性进行识别,为短时交通流的预测提供基础.基于混沌理论对交通流时间序列进行相空间重构,利用C-C算法计算时间延迟和嵌入维数,采用Grassberger-Procaccia算法计算吸引子关联维数,通过改进小数据量法计算最大Lyapunov指数来判别交通流时间序列的混沌特性.针对局域自适应预测方法在交通流多步预测中预测器系数无法调节的问题,提出了交通流多步自适应预测方法.通过实测数据计算,结果表明:2,4和5 min三种统计尺度的交通流时间序列均具有混沌特性;改进的小数据量法能够准确地计算出最大Lyapunov指数;构建的交通流多步自适应预测模型能够有效地预测交通流量的变化.为智能交通系统诱导和控制提供了依据.     

Geometric noise reduction for multivariate time series

We propose an algorithm for the reduction of observational noise in chaotic multivariate time series. The algorithm is based on a maximum likelihood criterion, and its goal is to reduce the mean distance of the points of the cleaned time series to the attractor. We give evidence of the convergence of the empirical measure associated with the cleaned time series to the underlying invariant measure, implying the possibility to predict the long run behavior of the true dynamics.     

Application of permutation entropy method in the analysis of chaotic,noisy, and chaotic noisy series

We have considered a permutation entropy method for analyzing chaotic, noisy, and chaotic noisy series. We have introduced the concept of permutation entropy from a survey of some features of information entropy (Shannon entropy), described the algorithm for its calculation, and indicated the advantages of this approach in the analysis of time series; the application of this method in the analysis of various model systems and experimental data has also been demonstrated.     

Noise in chaotic data: Diagnosis and treatment

A prominent limiting factor in the analysis of chaotic time series are measurement errors in the data. We show that this influence can be quite severe, depending on the nature of the noise, the complexity of the signal, and on the application one has in mind. Theoretical considerations yield general upper bounds on the tolerable noise level for dimension, entropy and Lyapunov estimates. We discuss methods to detect and analyze the noise present in a measured data set. We show how the situation can be improved by nonlinear noise reduction. (c) 1995 American Institute of Physics.