Related papers: Directional complexity and entropy for lift mappin…
We show the existence of Shilnikov-type dynamics and bifurcation behaviour in general discrete three-dimensional piecewise smooth maps and give analytical results for the occurence of such dynamical behaviour. Our main example in fact shows…
We consider some smooth maps on a bouquet of circles. For these maps we can compute the number of fixed points, the existence of periodic points and an exact formula for topological entropy. We use Lefschetz fixed point theory and actions…
We present a method to derive an upper bound for the entropy density of coupled map lattices with local interactions from local observations. To do this, we use an embedding technique being a combination of time delay and spatial embedding.…
The monotonicity of entropy is investigated for real quadratic rational maps on the real circle $\mathbb{R}\cup\{\infty\}$ based on the natural partition of the corresponding moduli space $\mathcal{M}_2(\mathbb{R})$ into its monotonic,…
We generalize the definition of topological entropy given by Adler, Konheim, and McAndrew (AKM) for piecewise continuous self-maps defined on a compact interval (pc-maps). For this notion of entropy, we prove that the properties of the…
In this study, we improve the topological complexity computations on digital images with introducing the digital topological complexity computations of a surjective and digitally continuous map between digital images. We also reveal…
Aspects of the dynamical glass transition are considered within a mean field spin glass model. At the dynamical transition the the system condenses in a state of lower entropy. The difference, the information entropy or complexity, is…
We give an algorithm, based on the $\phi$-expansion of Parry, in order to compute the topological entropy of a class of shift spaces. The idea is the solve an inverse problem for the dynamical systems $\beta x+\alpha \mod1$.The first part…
Here we present the entropic dynamics formalism for networks. That is, a framework for the dynamics of graphs meant to represent a network derived from the principle of maximum entropy and the rate of transition is obtained taking into…
In this chapter, we investigate directional entropy for semigroup actions generated by one-dimensional linear cellular automata (LCAs) and the shift transformation on the compact metric space $\mathbb{Z}_m^{\mathbb{N}}$. This work provides…
We trace the history of empirical entropy, touching briefly on its relation to Markov processes, normal numbers, Shannon entropy, the Chomsky hierarchy, Kolmogorov complexity, Ziv-Lempel compression, de Bruijn sequences and stochastic…
We propose a simple complexity indicator of classical Liouvillian dynamics, namely the separability entropy, which determines the logarithm of an effective number of terms in a Schmidt decomposition of phase space density with respect to an…
In this note we study the entropy spectrum of rotation classes for collections of finitely many continuous potentials $\varphi_1,\dots,\varphi_m:X\to \mathbb{R}$ with respect to the set of invariant measures of an underlying dynamical…
The concept of "$A$-coupled-expanding" map for a transition matrix $A$ has been studied as one of the most important criteria of chaos in the past years. In this paper, the lower bound of the topological entropy for strictly…
Stirring a two-dimensional viscous fluid with rods is often an effective way to mix. The topological features of periodic rod motions give a lower bound on the topological entropy of the induced flow map, since material lines must `catch'…
Visibility algorithms are a family of geometric and ordering criteria by which a real-valued time series of N data is mapped into a graph of N nodes. This graph has been shown to often inherit in its topology non-trivial properties of the…
We afford the problem of counting the blocks of a given length made with symbols drawn from an alphabet and relate this number to Fibonacci-like recurrent relations. The recurrence polynomia allows to calculate the limit ratio of two…
We investigate the properties of chain recurrent, chain transitive, and chain mixing maps (generalizations of the well-known notions of non-wandering, topologically transitive, and topologically mixing maps). We describe the structure of…
For differentiable dynamical systems with dominated splittings, we give upper estimates on the measure-theoretic tail entropy in terms of Lyapunov exponents. As our primary application, we verify the upper semi-continuity of metric entropy…
The maximum entropy method has recently been successfully introduced to a variety of natural language applications. In each of these applications, however, the power of the maximum entropy method is achieved at the cost of a considerable…