scholarly journals Parallel Dynamical Systems over Graphs and Related Topics: A Survey

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Juan A. Aledo ◽  
Silvia Martinez ◽  
Jose C. Valverde

In discrete processes, as computational or genetic ones, there are many entities and each entity has a state at a given time. The update of states of the entities constitutes an evolution in time of the system, that is, a discrete dynamical system. The relations among entities are usually represented by a graph. The update of the states is determined by the relations of the entities and some local functions which together constitute (global) evolution operator of the dynamical system. If the states of the entities are updated in a synchronous manner, the system is called aparallel dynamical system. This paper is devoted to review the main results on the dynamical behavior of parallel dynamical systems over graphs which constitute a generic tool for modeling discrete processes.

2008 ◽  
Vol 18 (05) ◽  
pp. 1425-1433 ◽  
Author(s):  
MILAN KUTNJAK ◽  
MATEJ MENCINGER

There is a one-to-one correspondence between homogeneous quadratic dynamical systems and commutative (possibly nonassociative) algebras. The corresponding theory for continuous systems is well known (c.f. [Markus, 1960; Walcher, 1991; Kinyon & Sagle, 1995]). In this paper the dynamics on the boundary of the basin of attraction of the origin, ∂ B Att (0), in homogeneous quadratic discrete dynamical systems is considered. In particular, we consider the dynamical behavior in a family of systems corresponding to a family of algebras [Formula: see text] which admits nilpotents of rank 2 and idempotents. The complete periodicity of a system (and the corresponding algebra) is defined and it is proven that for every n > 2 there are some systems/algebras from [Formula: see text] which are on ∂ BAtt(0) completely periodic with period n. The dynamics on ∂ B Att (0) is considered via a special class of polynomials Pn, n ∈ ℕ ∪ {0, -1}, recursively defined by Pn(α) = 2αPn-2(α) + Pn-1(α); P-1(α) = 0, P0(α) = 1, n ∈ ℕ.


2018 ◽  
Vol 14 (1) ◽  
pp. 35-51
Author(s):  
Sara Fernandes ◽  
Carlos Ramos ◽  
Gyan Bahadur Thapa ◽  
Luís Lopes ◽  
Clara Grácio

 Dynamical system is a mathematical formalization for any fixed rule that is described in time dependent fashion. The time can be measured by either of the number systems - integers, real numbers, complex numbers. A discrete dynamical system is a dynamical system whose state evolves over a state space in discrete time steps according to a fixed rule. This brief survey paper is concerned with the part of the work done by José Sousa Ramos [2] and some of his research students. We present the general theory of discrete dynamical systems and present results from applications to geometry, graph theory and synchronization. Journal of the Institute of Engineering, 2018, 14(1): 35-51


2019 ◽  
Vol 11 (11) ◽  
pp. 1612-1615
Author(s):  
Wadia Faid Hassan Al-Shameri

Lyapunov exponents play a significant part in revealing and quantifying chaos, which occurs in many areas of science and technology. The purpose of this study was to approximate the Lyapunov exponents for discrete dynamical systems and to present it as a quantifier for inferring and detecting the existence of chaos in those discrete dynamical systems. Finally, the approximation of the Lyapunov exponents for the discrete dynamical system was implemented using the Matlab code listed in the Appendix.


1984 ◽  
Vol 4 (3) ◽  
pp. 421-486 ◽  
Author(s):  
Joel W. Robbin

AbstractA universal unfolding of a discrete dynamical system f0 is a manifold F of dynamical systems such that each system g sufficiently near f0 is topologically conjugate to an element f of F with the conjugacy φ and the element f depending continuously on f0. An infinitesimally universal unfolding of f0 is (roughly speaking) a manifold F transversal to the topological conjugacy class of f0. Using Nash-Moser iteration we show infinitesimally universal unfoldings are universal and (in part II) give a class of examples relating to moduli of stability introduced by Palis and De Melo.


2019 ◽  
Vol 34 (32) ◽  
pp. 1950265
Author(s):  
Sh. Najmizadeh ◽  
M. Toomanian ◽  
M. R. Molaei ◽  
T. Nasirzade

In this paper, we extend the notion of Bekenstein–Hawking entropy for a cover of a site. We deduce a new class of discrete dynamical system on a site and we introduce the Bekenstein–Hawking entropy for each member of it. We present an upper bound for the Bekenstein–Hawking entropy of the iterations of a dynamical system. We define a conjugate relation on the set of dynamical systems on a site and we prove that the Bekenstein–Hawking entropy preserves under this relation. We also prove that the twistor correspondence preserves the Bekenstein–Hawking entropy.


2005 ◽  
Vol 15 (02) ◽  
pp. 253-382 ◽  
Author(s):  
ELEONORA BILOTTA ◽  
STEFANIA GERVASI ◽  
PIETRO PANTANO

Modern Science is finding new methods of looking at biological, physical or social phenomena. Traditional methods of quantification are no longer sufficient and new approaches are emerging. These approaches make it apparent that the phenomena the observer is looking at are not classifiable by conventional methods. These phenomena are complex. A complex system, as Chua's oscillator, is a nonlinear configuration whose dynamical behavior is chaotic. Chua's oscillator equations allow to define the basic behavior of a dynamical system and to detect the changes in the qualitative behavior of a system when bifurcation occurs, as parameters are varied. The typical set of behavior of a dynamical system can be detailed as equilibrium points, limit cycles, strange attractors. The concepts, methods and paradigms of Dynamical Systems Theory can be applied to understand human behavior. Human behavior is emergent and behavior patterns emerge thanks to the way the parts or the processes are coordinated among themselves. In fact, the listening process in humans is complex and it develops over time as well. Sound and music can be both inside and outside humans. This tutorial concerns the translation of Chua's oscillators into music, in order to find a new way of understanding complexity by using music. By building up many computational models which allow the translation of some quantitative features of Chua's oscillator into sound and music, we have created many acoustical and musical compositions, which in turn present the characteristics of dynamical systems from a perceptual point of view. We have found interesting relationships between dynamical systems behavior and their musical translation since, in the process of listening, human subjects perceive many of the structures as possible to perceive in the behavior of Chua's oscillator. In other words, human cognitive abilities can analyze the large and complicated patterns produced by Chua's systems translated into music, achieving the cognitive economy and the coordination and synthesis of countless data at our disposal that occur in the perception of dynamic events in the real world. Music can be considered the semantics of dynamical systems, which gives us a powerful method for interpreting complexity.


10.37236/7017 ◽  
2018 ◽  
Vol 25 (3) ◽  
Author(s):  
Maximilien Gadouleau

A finite dynamical system is a function $f : A^n \to A^n$ where $A$ is a finite alphabet, used to model a network of interacting entities. The main feature of a finite dynamical system is its interaction graph, which indicates which local functions depend on which variables; the interaction graph is a qualitative representation of the interactions amongst entities on the network. The rank of a finite dynamical system is the cardinality of its image; the periodic rank is the number of its periodic points. In this paper, we determine the maximum rank and the maximum periodic rank of a finite dynamical system with a given interaction graph over any non-Boolean alphabet. The rank and the maximum rank are both computable in polynomial time. We also obtain a similar result for Boolean finite dynamical systems (also known as Boolean networks) whose interaction graphs are contained in a given digraph. We then prove that the average rank is relatively close (as the size of the alphabet is large) to the maximum. The results mentioned above only deal with the parallel update schedule. We finally determine the maximum rank over all block-sequential update schedules and the supremum periodic rank over all complete update schedules.


1994 ◽  
Vol 49 (3) ◽  
pp. 469-481 ◽  
Author(s):  
Francisco Esquembre

Constructive, simple proofs for the existence, regularity, continuous dependence and dynamical properties of a repelling invariant curve for a discrete dynamical system of the plane with an attracting fixed point with real eigenvalues are given. These proofs can be used to generate a numerical algorithm to find these curves and to compute explicitly the dependence of the curve with respect to the system.


2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Dhaval Thakkar ◽  
Ruchi Das

We define and study expansiveness, shadowing, and topological stability for a nonautonomous discrete dynamical system induced by a sequence of homeomorphisms on a metric space.


1995 ◽  
Vol 51 (2) ◽  
pp. 273-286
Author(s):  
Francisco Esquembre

We study the properties of an invariant attracting curve passing through an attracting fixed point of a planar discrete dynamical system. We compare these properties to the corresponding properties of the invariant repelling curve studied in [3] in order to determine the dynamic behaviour of the system near the fixed point.


Sign in / Sign up

Export Citation Format

Share Document