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.
In this paper, we provide and study a discrete model for the transmission of Babesiosis disease in bovine and tick populations. This model supposes a discretization of the continuous-time model developed by us previously. The results, here obtained by discrete methods as opposed to continuous ones, show that similar conclusions can be obtained for the discrete model subject to the assumption of some parametric constraints which were not necessary in the continuous case. We prove that these parametric constraints are not artificial and, in fact, they can be deduced from the biological significance of the model. Finally, some numerical simulations are given to validate the model and verify our theoretical study.
In this work, we provide conditions to obtain fixed point theorems for parallel dynamical systems over graphs with (Boolean) maxterms and minterms as global evolution operators. In order to do that, we previously prove that periodic orbits of different periods cannot coexist, which implies that Sharkovsky’s order is not valid for this kind of dynamical systems.