Related papers: Genericity and Rigidity for Slow Entropy Transform…
In 1997, Katok--Thouvenot and Ferenczi independently introduced a notion of ``slow entropy'' as a way to quantitatively compare measure-preserving systems with zero entropy. We develop a relative version of this theory for a…
Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…
We consider topological dynamical systems given by skew products $S\rtimes_{\tau} T$, where $S\colon Y\to Y$ is a subshift, $\tau\colon Y\to\mathbb{Z}$ is a continuous cocycle, and $T$ is an arbitrary invertible topological system. For…
This paper defines and discusses the dimension notion of topological slow entropy of any subset for Z^d actions. Also, the notion of measure-theoretic slow entropy for Z^d actions is presented, which is modified from Brin and Katok [2].…
Measure-theoretic and topological entropy are classical invariants in the theory of dynamical systems. There are several recently developed entropy type invariants for systems of sub-exponential growth: sequence entropy, slow entropy,…
The Anosov-Katok method is one of the most powerful tools of constructing smooth volume-preserving diffeomorphisms of entropy zero with prescribed ergodic or topological properties. To measure the complexity of systems with entropy zero,…
We introduce the notion of metric entropy for a nonautonomous dynamical system given by a sequence of probability spaces and a sequence of measure-preserving maps between these spaces. This notion generalizes the classical concept of metric…
The main purpose of this article is to provide a common generalization of the notions of a topological and Kolmogorov-Sinai entropy for arbitrary representations of discrete amenable groups on objects of (abstract) categories. This is…
There is no single universally accepted definition of "Complexity". There are several perspectives on complexity and what constitutes complex behaviour or complex systems, as opposed to regular, predictable behaviour and simple systems. In…
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 define variational properties for dynamical systems with subexponential complexity, and study these properties in certain specific examples. By computing the value of slow entropy directly, we show that some subshifts are not…
We study an entropy measure for quantum systems that generalizes the von Neumann entropy as well as its classical counterpart, the Gibbs or Shannon entropy. The entropy measure is based on hypothesis testing and has an elegant formulation…
In this work, we introduce the notion of entropy at infinity, and define a wide class of noncompact manifolds with negative curvature, those which admit a critical gap between entropy at infinity and topological entropy. We call them…
Inspired by Katok's intermediate entropy property [Inst. Hautes \'Etudes Sci. Publ. Math. 51 (1980), 137-173], we introduce and study the notion of entropy flexibility for discrete-time and continuous-time dynamical systems. By using…
We discuss the Kolmogorov's entropy and Sinai's definition of it; and then define a deformation of the entropy, called {\it scaling entropy}; this is also a metric invariant of the measure preserving actions of the group, which is more…
We extend the notion of estimation entropy of autonomous dynamical systems proposed by Liberzon and Mitra [1] to nonlinear dynamical systems with uncertain inputs with bounded variation. We call this new notion the {$\epsilon$}-estimation…
We calculate slow entropy type invariant introduced by A. Katok and J.-P. Thouvenot in [5] for higher rank smooth abelian actions for two leading cases: when the invariant measure is absolutely continuous and when it is hyperbolic. We…
The problem of defining and studying complexity of a time series has interested people for years. In the context of dynamical systems, Grassberger has suggested that a slow approach of the entropy to its extensive asymptotic limit is a sign…
Some aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov-Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize how a…
Shannon and Khinchin showed that assuming four information theoretic axioms the entropy must be of Boltzmann-Gibbs type, $S=-\sum_i p_i \log p_i$. Here we note that in physical systems one of these axioms may be violated. For non-ergodic…