Related papers: Enlarged scaling ranges for the KS-entropy and the…
In this paper, we present some results on information, complexity and entropy as defined below and we discuss their relations with the Kolmogorov-Sinai entropy which is the most important invariant of a dynamical system. These results have…
We present an upper bound for the Kolmogorov-Sinai entropy of quantum systems having a mixing quantum phase space. The method for this estimation is based on the following ingredients: i) the graininess of quantum phase space in virtue of…
We present some new results which relate information to chaotic dynamics. In our approach the quantity of information is measured by the Algorithmic Information Content (Kolmogorov complexity) or by a sort of computable version of it…
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…
The deterministic notions of capacity and entropy are studied in the context of communication and storage of information using square-integrable, bandlimited signals subject to perturbation. The $(\epsilon,\delta)$-capacity, that extends…
Under certain conditions, the rate of increase of the statistical entropy of a simple, fully chaotic, conservative system is known to be given by a single number, characteristic of this system, the Kolmogorov-Sinai entropy rate. This…
We consider an extension of $\epsilon$-entropy to a KL-divergence based complexity measure for randomized density estimation methods. Based on this extension, we develop a general information-theoretical inequality that measures the…
We study the approach to equilibrium of systems of gas particles in terms of relative entropy. The systems are modeled by the Kac master equation in arbitrary dimensions. First, we study the Kac system coupled to a thermostat, and secondly…
Since the emergence of research on improving the length extrapolation capabilities of large language models in 2021, some studies have made modifications to the scaling factor in the scaled dot-product attention mechanism as part of their…
It is shown that stringy matter near the event horizon of a Schwarzschild black hole exhibits chaotic behavior (the spreading effect) which can be characterized by the Kolmogorov-Sinai entropy. It is found that the Kolmogorov-Sinai entropy…
According to a previous conjecture, spatial and temporal Lyapunov exponents of chaotic extended systems can be obtained from derivatives of a suitable function: the entropy potential. The validity and the consequences of this hypothesis are…
It is shown that instability of stringy matter near the event horizon of a black hole (the spreading effect) can be characterized by the Lyapunov exponents. The Kolmogorov-Sinai entropy is the sum of all the positive Lyapunov exponents and…
We address the problem of applying the Kolmogorov-Sinai method of entropic analysis, expressed in a generalized non-extensive form, to the dynamics of the logistic map at the chaotic threshold, which is known to be characterized by a power…
We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on…
In an equilibrium system, the Kolmogorov-Sinai entropy, $h_{\mathrm{KS}}$, equals the sum of the positive Lyapunov exponents, the exponential rates of divergence of infinitesimal perturbations. Kinetic theory may be used to calculate the…
Entropy estimation, due in part to its connection with mutual information, has seen considerable use in the study of time series data including causality detection and information flow. In many cases, the entropy is estimated using…
Around the mean dimensions and rate-distortion functions, using some tools from local entropy theory this paper establishes the following main results: $(1)$ We prove that for non-ergodic measures associated with almost sure processes, the…
Since Bandt et al. have shown that the permutation entropy and the Kolmogorov-Sinai entropy coincide for piecewise monotone interval maps, the relationship of both entropies for time-discrete dynamical systems is of a certain interest. The…
We numerically calculate, at the edge of chaos, the time evolution of the nonextensive entropic form $S_q \equiv [1-\sum_{i=1}^W p_i^q]/[q-1]$ (with $S_1=-\sum_{i=1}^Wp_i \ln p_i$) for two families of one-dimensional dissipative maps,…
We prove an inequality for the entropy numbers in terms of nonlinear Kolmogorov's widths. This inequality is in a spirit of known inequalities of this type and it is adjusted to the form convenient in applications for $m$-term…