Automatized Search for Complex Symbolic Dynamics with Applications in the Analysis of a Simple Memristor Circuit

2014 ◽  
Vol 24 (07) ◽  
pp. 1450104 ◽  
Author(s):  
Zbigniew Galias
Keyword(s):  
Dynamical System ◽  
Topological Entropy ◽  
Lower Bounds ◽  
Symbolic Dynamics ◽  
Third Order ◽  
Return Map ◽  
Topological Sense

An automatized method to search for complex symbolic dynamics is proposed. The method can be used to show that a given dynamical system is chaotic in the topological sense. Application of this method in the analysis of a third-order memristor circuit is presented. Several examples of symbolic dynamics are constructed. Positive lower bounds for the topological entropy of an associated return map are found showing that the system is chaotic in the topological sense.

scholarly journals Kinematics in Biology: Symbolic Dynamics Approach

Mathematics ◽  
2020 ◽  
Vol 8 (3) ◽  
pp. 339
Author(s):  
Carlos Correia Ramos
Keyword(s):  
Dynamical System ◽  
Topological Entropy ◽  
Empirical Data ◽  
Symbolic Dynamics ◽  
Discrete Dynamical System ◽  
Building Blocks ◽  
Geometrical Method ◽  
Two Parameters ◽  
Complex Trajectories

Motion in biology is studied through a descriptive geometrical method. We consider a deterministic discrete dynamical system used to simulate and classify a variety of types of movements which can be seen as templates and building blocks of more complex trajectories. The dynamical system is determined by the iteration of a bimodal interval map dependent on two parameters, up to scaling, generalizing a previous work. The characterization of the trajectories uses the classifying tools from symbolic dynamics—kneading sequences, topological entropy and growth number. We consider also the isentropic trajectories, trajectories with constant topological entropy, which are related with the possible existence of a constant drift. We introduce the concepts of pure and mixed bimodal trajectories which give much more flexibility to the model, maintaining it simple. We discuss several procedures that may allow the use of the model to characterize empirical data.

Perturbations of multidimensional shifts of finite type

2010 ◽  
Vol 31 (2) ◽  
pp. 483-526 ◽  
Author(s):  
RONNIE PAVLOV
Keyword(s):  
Finite Type ◽  
Lower Bounds ◽  
Symbolic Dynamics ◽  
Upper And Lower Bounds ◽  
Shift Of Finite Type ◽  
Strongly Irreducible ◽  
Dimensional Cube

AbstractIn this paper, we study perturbations of multidimensional shifts of finite type. Specifically, for any ℤd shift of finite type X with d>1 and any finite pattern w in the language of X, we denote by Xw the set of elements of X not containing w. For strongly irreducible X and patterns w with shape a d-dimensional cube, we obtain upper and lower bounds on htop (X)−htop (Xw) dependent on the size of w. This extends a result of Lind for d=1 . We also apply our methods to an undecidability question in ℤd symbolic dynamics.

Two Simplest Quadratic Chaotic Maps Without Equilibrium

2018 ◽  
Vol 28 (12) ◽  
pp. 1850144 ◽  
Author(s):  
Shirin Panahi ◽  
Julien C. Sprott ◽  
Sajad Jafari
Keyword(s):  
Dynamical System ◽  
Bifurcation Diagram ◽  
Lyapunov Exponents ◽  
Chaotic Maps ◽  
Basin Of Attraction ◽  
Hidden Attractor ◽  
Return Map ◽  
Right Hand ◽  
Dynamical Properties ◽  
The Right

Two simple chaotic maps without equilibria are proposed in this paper. All nonlinearities are quadratic and the functions of the right-hand side of the equations are continuous. The procedure of their design is explained and their dynamical properties such as return map, bifurcation diagram, Lyapunov exponents, and basin of attraction are investigated. These maps belong to the hidden attractor category which is a newly introduced category of dynamical system.

scholarly journals Subshifts on Infinite Alphabets and Their Entropy

Entropy ◽  
2020 ◽  
Vol 22 (11) ◽  
pp. 1293
Author(s):  
Sharwin Rezagholi
Keyword(s):  
Growth Rate ◽  
Markov Chains ◽  
Topological Entropy ◽  
Spectral Radius ◽  
Symbolic Dynamics ◽  
Infinite Graphs ◽  
Complexity Function ◽  
Countably Infinite

We analyze symbolic dynamics to infinite alphabets by endowing the alphabet with the cofinite topology. The topological entropy is shown to be equal to the supremum of the growth rate of the complexity function with respect to finite subalphabets. For the case of topological Markov chains induced by countably infinite graphs, our approach yields the same entropy as the approach of Gurevich We give formulae for the entropy of countable topological Markov chains in terms of the spectral radius in l2.

scholarly journals Analysis of Large-Amplitude Pulses in Short Time Intervals: Application to Neuron Interactions

2010 ◽  
Vol 2010 ◽  
pp. 1-15 ◽  
Author(s):  
Gianni Mattioli ◽  
Massimo Scalia ◽  
Carlo Cattani
Keyword(s):  
Dynamical System ◽  
Order Approximation ◽  
Nonlinear Dynamical System ◽  
High Amplitude ◽  
Time Dependent ◽  
Third Order ◽  
Time Intervals ◽  
Nonlinear Dynamical ◽  
Short Time ◽  
Third Order Approximation

This paper deals with the analysis of a nonlinear dynamical system which characterizes the axons interaction and is based on a generalization of FitzHugh-Nagumo system. The parametric domain of stability is investigated for both the linear and third-order approximation. A further generalization is studied in presence of high-amplitude (time-dependent) pulse. The corresponding numerical solution for some given values of parameters are analyzed through the wavelet coefficients, showing both the sensitivity to local jumps and some unexpected inertia of neuron's as response to the high-amplitude spike.

scholarly journals On topological entropy of triangular maps of the square

1993 ◽  
Vol 48 (1) ◽  
pp. 55-67 ◽  
Author(s):  
Lluís Alsedà ◽  
Sergiĭ F. Kolyada ◽  
Ľubomír Snoha
Keyword(s):  
Topological Entropy ◽  
Lower Bounds ◽  
Lower Semicontinuous ◽  
Continuous Maps ◽  
Triangular Maps

We study the topological entropy of triangular maps of the square. We show that such maps differ from the continuous maps of the interval because there exist triangular maps of the square of “type 2∞” with infinite topological entropy. The set of such maps is dense in the space of triangular maps of “type at most 2∞” and the topological entropy as a function of the triangular maps of the square is not lower semicontinuous. However, we show that for these maps the characterisation of the lower bounds of the topological entropy depending on the set of periods is the same as for the continuous maps of the interval.

Sign in / Sign up

Export Citation Format

Share Document