Permutation entropy measures the complexity of a deterministic time series via a data symbolic quantization consisting of rank vectors called ordinal patterns or simply permutations. 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 happens when time series are output by dynamical systems with observational or dynamical noise or purely random processes. In this paper, we propose a generalized permutation entropy, belonging to the class of group entropies, that is finite in that situation, which is actually the one found in practice. The theoretical results are illustrated numerically by random processes with short- and long-term dependencies, as well as by noisy deterministic signals.
A certain vector-tensor theory is revisited. It was proposed and analyzed as a theory of electromagnetism without the standard gauge invariance. Our attention is first focused on a detailed variational formulation of the theory, which leads to both a modified Lorentz force and the true energy-momentum tensor of the vector field. The theory is then applied to cosmology. A complete gauge invariant treatment of the scalar perturbations is presented. For appropriate gauge invariant variables describing the scalar modes of the vector field (A~modes), it is proved that the evolution equations of these modes do not involve the scalar modes appearing in general relativity (GR~modes), which are associated to the metric and the energy-momentum tensor of the cosmological fluids. However, the A~modes modify the standard gauge invariant equations describing the GR~modes. By using the new formalism, the evolution equations of the A~perturbations are derived and separately solved and, then, the correction terms\char22{}due to the A~perturbations\char22{}appearing in the evolution equations of the GR~modes are estimated. The evolution of these correction terms is studied for an appropriate scale. The relevance of these terms depends on both the spectra and the values of the normalization constants involved in extended electromagnetism. Further applications of the new formalism will be presented elsewhere.
Given two unidirectionally coupled nonlinear systems, we speak of generalized synchronization when the responder “follows” the driver. Mathematically, this situation is implemented by a map from the driver state space to the responder state space termed the synchronization map. In nonlinear times series analysis, the framework of the present work, the existence of the synchronization map amounts to the invertibility of the so-called cross map, which is a continuous map that exists in the reconstructed state spaces for typical time-delay embeddings. The cross map plays a central role in some techniques to detect functional dependencies between time series. In this paper, we study the changes in the “noiseless scenario” just described when noise is present in the driver, a more realistic situation that we call the “noisy scenario.” Noise will be modeled using a family of driving dynamics indexed by a finite number of parameters, which is sufficiently general for practical purposes. In this approach, it turns out that the cross and synchronization maps can be extended to the noisy scenario as families of maps that depend on the noise parameters, and only for “generic” driver states in the case of the cross map. To reveal generalized synchronization in both the noiseless and noisy scenarios, we check the existence of synchronization maps of higher periods (introduced in this paper) using recurrent neural networks and predictability. The results obtained with synthetic and real-world data demonstrate the capability of our method.
1 November 2022 in Chaos: An Interdisciplinary Journal of Nonlinear Science
This is a review of group entropy and its application to permutation complexity. Specifically, we revisit a new approach to the notion of complexity in the time series analysis based on both permutation entropy and group entropy. As a result, the permutation entropy rate can be extended from deterministic dynamics to random processes. More generally, our approach provides a unified framework to discuss chaotic and random behaviors.