Entropy of Dynamical Systems with Repetition Property

The repetition property of a dynamical system, a notion introduced in Boshernitzan and Damanik (Commun Math Phys 283:647–662, 2008), plays an importance role in analyzing spectral properties of ergodic Schrödinger operators. In this paper, entropy of dynamical systems with repetition property is investigated. It is shown that the topological entropy of dynamical systems with the global repetition property is zero. Minimal dynamical systems having both topological repetition property and positive topological entropy are constructed. This provides a class of ergodic Schrödinger operators with potentials generated by positive entropy minimal dynamical systems that, in contrast to common beliefs, admit no eigenvalues.     

Entropy for Symbolic Dynamics with Overlapping Alphabets

We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces and show that it is equal to a limit of entropies of standard (non-overlapping) shifts when the underlying shift is of finite type. When a shift space with overlaps arises as a model for a discrete dynamical system with a finite set of overlapping neighborhoods, the entropy gives a lower bound for the topological entropy of the dynamical system.     

Introduction to Nonlinear Dynamics of Electronic Systems: Tutorial

The study of chaos has generated enormous interest in exploring the complexity of the behavior in nature and in technology. Many of the important features of chaotic dynamical systems can be seen using experimental and computational methods in simple nonlinear mechanical systems or electronic circuits. Starting with the study of a chaotic nonlinear mechanical system (driven damped pendulum) or a nonlinear electronic system (circuit Chua) we introduce the reader into the concepts of chaos order in Sharkovsky's sense, and topological invariants (topological entropy and topological frequencies). The Kirchhoff's circuit laws are a pair of laws that deal with the conservation of charge and energy in electric circuits, and the algebraic theory of graphs characterizes these linear systems in terms of cycles and cocycles (or cuts). Here we discuss methods (topological semiconjugacy to piecewise linear maps and Markov graphs) to find a similar situation for the nonlinear dynamics, to understanding chaotic dynamics. Thus to chaotic dynamics we associate a Markov graph, where the dynamical and topological invariants will be seen as graph theoretical quantities.     

Rich dynamics caused by diffusion

It is an awfully difficult task to design an efficient numerical method for bifurcation diagrams, the graphs of Lyapunov exponents, or the topological entropy about discrete dynamical systems by linear/nonlinear diffusion with the Direchlet/Neumann- boundary conditions. Until now there are less works concerned with such a problem. In this paper, we propose a scheme about bifurcating analysis in a series of discrete-time dynamical systems with linear/nonlinear diffusion terms under the periodic boundary conditions. The complexity of dynamical behaviors caused by the diffusion term are to be determined. Bifurcation diagrams are shown by numerical simulation and chaotic behavior (chaotic Turing patterns) is demonstrated by computing the largest Lyapunov exponent. Our theoretical model can give an interesting case study about the phenomenon: the individuals exhibit a very simple dynamics but the groups with linear/nonlinear coupling can own a complex dynamics including fluctuation, periodicity and even chaotic behavior. We find that diffusion can trigger chaotic behavior in the present system and there exist multiple Turing patterns. It is interesting as regular or chaotic patterns can be reported in this study. Chaotic orbits emerge when exploring further in the diffusion coefficient space, and such a behavior is entirely absent in the corresponding continuous time-space system. The method proposed in the present paper is innovative and the conclusion is novel.

     

Conductance and Noncommutative Dynamical Systems

In this work, we introduce the notion of conductance in the context of Cuntz–Krieger C^∗-algebras. These algebras can be seen as a noncommutative version of topological Markov chains. Conductance is a useful notion in the theory of Markov chains to study the approach of a system to the equilibrium state. Our goal is twofold. On one hand, conductance can be used to measure the complexity of dynamical systems, complementing topological entropy. On the other hand, using C^∗-algebras, we can give a natural framework to analyze the path space of a finite graph associated to a Markov shift.     

动力系统的复杂性刻划

本文扼要地综述了近年来提出的刻划动力系统复杂性的各种度量．着重点在于将复杂性同随机性区分开．由此对于过去为刻划混沌而提出的度量,其中包括Ｌｙａｐｕｎｏｖ指数、拓扑熵、测度熵和Ｋｏｌｍｏｇｏｒｏｖ复杂性等,作了简单回顾．从自动机和信息论的观点对于包括ＡＣ、ＳＣ、ＥＭＣ在内的新提出的复杂性度量作了阐述．通过单峰映射和一维元胞自动机等例子对上述复杂性度量进行了比较,并较详细地介绍了利用形式语言和自动机来分析动力系统的方法．      

Weighted Topological Entropy of the Set of Generic Points in Topological Dynamical Systems

This article is devoted to the investigation of the weighted topological entropy of generic points of the ergodic measures in dynamical systems. We showed that the weighted topological entropy of generic points of the ergodic measure \(\mu \) is equal to the weighted measure entropy of \(\mu ,\) which generalized the classical result of Bowen (Trans Am Math Soc 184:125–136, 1973). As an application, we also use the result to study the dimension of generic points for a class of skew product expanding maps on high dimensional tori.     

On Entropy of Graph Maps That Give Hereditarily Indecomposable Inverse Limits

We prove that if \(f:G\rightarrow G\) is a map on a topological graph G such that the inverse limit \(\varprojlim (G,f)\) is hereditarily indecomposable, and entropy of f is positive, then there exists an entropy set with infinite topological entropy. When G is the circle and the degree of f is positive then the entropy is always infinite and the rotation set of f is nondegenerate. This shows that the Anosov-Katok type constructions of the pseudo-circle as a minimal set in volume-preserving smooth dynamical systems, or in complex dynamics, obtained previously by Handel, Herman and Chéritat cannot be modeled on inverse limits. This also extends a previous result of Mouron who proved that if \(G=[0,1]\), then \(h(f)\in \{0,\infty \}\), and combined with a result of Ito shows that certain dynamical systems on compact finite-dimensional Riemannian manifolds must either have zero entropy on their invariant sets or be non-differentiable.     

Solution Structure of Multi-layer Neural Networks with Initial Condition

This paper studies the initial value problem of multi-layer cellular neural networks. We demonstrate that the mosaic solutions of such system is topologically conjugated to a new class in symbolic dynamical systems called the path set (Abram and Lagarias in Adv Appl Math 56:109–134, 2014). The topological entropies of the solution, output, and hidden spaces of a multi-layer cellular neural network with initial condition are formulated explicitly. Also, a sufficient condition for whether the mosaic solution space of a multi-layer cellular neural network is independent of initial conditions is addressed. Furthermore, two spaces exhibit identical topological entropy if and only if they are finitely equivalent.     

A novel construction of chaotic dynamics base gliders in diffusion rule B2/S7

The dynamical behaviors of gliders (mobile localizations) in diffusion rule B2/S7 are quantitatively analyzed from the theory of symbolic dynamics in two-dimensional symbolic sequence space. Their intrinsic complexity is demonstrated by exploiting the relationship between one-dimensional and two-dimensional subshifts. Based on this rigorous approach and technique, the underlying chaos of the extant gliders and their combinations is characterized in a subtle way. It is demonstrated that they can be identified to distinct subsystems with very rich and complicated dynamics; that is, diffusion rule is topologically mixing and possesses positive topological entropy on each subsystem. This analytical assertion provides the fact that diffusion rule is covered with complex subsystems “almost everywhere”. Finally, it is worth mentioning that the procedure proposed in this paper is also applicable to all other gliders arising from the two-dimensional cellular automata therein. It is an extended discovery in both cellular automata and chaos theory.     

Spatial and Dynamical Chaos Generated by Reaction–Diffusion Systems in Unbounded Domains

We consider in this article a nonlinear reaction–diffusion system with a transport term (L,∇ _x )u, where L is a given vector field, in an unbounded domain Ω. We prove that, under natural assumptions, this system possesses a locally compact attractor in the corresponding phase space. Since the dimension of this attractor is usually infinite, we study its Kolmogorov’s ɛ-entropy and obtain upper and lower bounds of this entropy. Moreover, we give a more detailed study of the spatio-temporal chaos generated by the spatially homogeneous RDS in . In order to describe this chaos, we introduce an extended (n + 1)-parametrical semigroup, generated on the attractor by 1-parametrical temporal dynamics and by n-parametrical group of spatial shifts ( = spatial dynamics). We prove that this extended semigroup has finite topological entropy, in contrast to the case of purely temporal or purely spatial dynamics, where the topological entropy is infinite. We also modify the concept of topological entropy in such a way that the modified one is finite and strictly positive, in particular for purely temporal and for purely spatial dynamics on the attractor. In order to clarify the nature of the spatial and temporal chaos on the attractor, we use (following Zelik, 2003, Comm. Pure. Appl. Math. 56(5), 584–637) another model dynamical system, which is an adaptation of Bernoulli shifts to the case of infinite entropy and construct homeomorphic embeddings of it into the spatial and temporal dynamics on . As a corollary of the obtained embeddings, we finally prove that every finite dimensional dynamics can be realized (up to a homeomorphism) by restricting the temporal dynamics to the appropriate invariant subset of .     

Topological classification of linear hyperbolic cocycles

In this paper linear hyperbolic cocycles are classified by the relation of topological conjugacy. Roughly speaking, two linear cocycles are conjugate if there exists a homeomorphism which maps their trajectories into each other. The problem of classification of discrete-time deterministic hyperbolic dynamical systems was investigated by Robbin (1972). He proved that there exist 4d classes ofd-dimensional deterministic discrete hyperbolic dynamical systems. We obtain a criterion for topological conjugacy of two linear hyperbolic cocycles and show that the number of classes depends crucially on the ergodic properties of the metric dynamical system over which they are defined. Our result is a generalization of the deterministic theorem of Robbin.     

Minimal Spaces with Cyclic Group of Homeomorphisms

There are two main subjects in this paper. (1) For a topological dynamical system \((X,T)\) we study the topological entropy of its “functional envelopes” (the action of \(T\) by left composition on the space of all continuous self-maps or on the space of all self-homeomorphisms of \(X\)). In particular we prove that for zero-dimensional spaces \(X\) both entropies are infinite except when \(T\) is equicontinuous (then both equal zero). (2) We call Slovak space any compact metric space whose homeomorphism group is cyclic and generated by a minimal homeomorphism. Using Slovak spaces we provide examples of (minimal) systems \((X,T)\) with positive entropy, yet, whose functional envelope on homeomorphisms has entropy zero (answering a question posed by Kolyada and Semikina). Finally, also using Slovak spaces, we resolve a long standing open problem whether the circle is a unique non-degenerate continuum admitting minimal continuous transformations but only invertible: No, some Slovak spaces are such, as well.     

Principal difference between stability and structural stability (robustness) as used in systems biology

The concepts stability and structural stability (robustness) are used often in systems biology. According to Kitano (2004) robustness is a fundamental property of evolvable complex biological systems. For that reason, the purpose of this review is to clarify: (a) how are strictly formulated concepts, such as stability and robustness of a dynamical system, used in computational systems biology; (b) what is meant by structural stability (robustness) in contemporary biology and how are stability and robustness distinguished from each other; and (c) why is it necessary to investigate whether a cell signal pathway is stable. We formulate the two concepts stability and structural stability (robustness) of a dynamical system with an arbitrary dimensionality, in the way they are known in mathematics and mechanics, and clarify the principal difference between them. We also consider how these two concepts are used in the analysis of a concrete biological system in systems biology. In the last section we formulate when, according to us, in biology (and in systems biology in particular), it should be said that a system (process) is stable, and when it is structurally stable.     

An Algorithmic Approach to the Conley Index Theory

We introduce a class of representable sets which is closed under the operations of set theoretical union, intersection, difference, and topological interior and closure. We use this class to construct an algorithm which verifies if for a given dynamical system a given set is an isolating neighborhood. In the case of a positive answer the algorithm constructs an index pair.     

Dynamical Order in Systems of Coupled Noisy Oscillators

We investigate a dynamical order induced by coupling and/or noise in systems of coupled oscillators. The dynamical order is referred to a one-dimensional topological structure of the global attractor of the system in the context of random skew-product flows. We show that if the coupling is sufficiently strong, then the system exhibits one dimensional dynamics regardless of the strength of noise. If the coupling is weak, then it is shown numerically that the system also exhibits one dimensional dynamics provided the noise is sufficiently strong. We also show that for any coupling and any noise, the system has a unique rotation number and hence all the oscillators tend to oscillate with the same frequency eventually (frequency locking). Dedicated to Professor Pavol Brunovsky on the occasion of his 70th birthday.     

Shadowing Property, Weak Mixing and Regular Recurrence

We show that a non-wandering dynamical system with the shadowing property is either equicontinuous or has positive entropy and that in this context uniformly positive entropy is equivalent to weak mixing. We also show that weak mixing together with the shadowing property imply the specification property with a special kind of regularity in tracing (a weaker version of periodic specification property). This in turn implies that the set of ergodic measures supported on the closures of orbits of regularly recurrent points is dense in the space of all invariant measures (in particular, invariant measures in such a system form the Poulsen simplex, up to an affine homeomorphism).     

树形多体系统非线性动力学的数值分析方法

研究了树形多体系统大线性动力学分析的数值方法,利用多体系统的正则方程及其线性化程,给出了多体系统Ｌｙａｐｕｎｏｖ指数和Ｐｏｉｎｃａｒｅ映射的计算方法,该算法具有较好的计算精度和通用性,既适用于说明该算法的有效性,并对该系统的动力学行为进行分析,最后用算例说明该算法的有效性,并对该系统的动力学特征（周期解、准周期解、分岔、混沌以及通往混沌的道路等）进行了分析。