Related papers: On the algorithmic descriptive complexity of attra…
We study discrete dynamical systems through the topological concepts of limit set, which consists of all points that can be reached arbitrarily late, and asymptotic set, which consists of all adhering values of orbits. In particular, we…
We recall the definition of the $\epsilon$-distortion complexity of a set defined in \cite{bcc} and the results obtained in this paper for Cantor sets of the interval defined by iterated function systems. We state an analogous definition…
We study the asymptotic dynamics of piecewise contracting maps defined on a compact interval. For maps that are not necessarily injective, but have a finite number of local extrema and discontinuity points, we prove the existence of a…
We describe the approximation of a continuous dynamical system on a p. l. manifold or Cantor set by a tractable system. A system is tractable when it has a finite number of chain components and, with respect to a given full background…
We study the asymptotic dynamics of maps which are piecewise contracting on a compact space. These maps are Lipschitz continuous, with Lipschitz constant smaller than one, when restricted to any piece of a finite and dense union of disjoint…
Living systems, from single cells to higher vertebrates, receive a continuous stream of non-stationary inputs that they sense, e.g., via cell surface receptors or sensory organs. Integrating these time-varying, multi-sensory, and often…
In this work, we relate the geometry of chaotic attractors of typical analytic unimodal maps to the behavior of the critical orbit. Our main result is an explicit formula relating the combinatorics of the critical orbit with the exponents…
In a topological dynamical system the complexity of an orbit is a measure of the amount of information (algorithmic information content) that is necessary to describe the orbit. This indicator is invariant up to topological conjugation. We…
In this paper, we will study the statistical behaviors of orbits. Firstly, we will show that for a dynamical systems have the shadowing property or almost specification property, the set of nonrecurrent points has full topological entropy.…
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is chosen and a general algorithm is presented. The correctness of…
The correct computation of orbits of discrete dynamical systems on the interval is considered. Therefore, an arbitrary-precision floating-point approach based on automatic error analysis is chosen and a general algorithm is presented. The…
While the notion of chaos is well established for dynamical systems on manifolds, it is not so for dynamical systems over discrete spaces with $ N $ variables, as binary neural networks and cellular automata. The main difficulty is the…
The random map model is a deterministic dynamical system in a finite phase space with n points. The map that establishes the dynamics of the system is constructed by randomly choosing, for every point, another one as being its image. We…
A succesful method to describe the asymptotic behavior of a discrete time stochastic process governed by some recursive formula is to relate it to the limit sets of a well chosen mean differential equation. Under an attainability condition,…
Motivation: Models of discrete concurrent systems often lead to huge and complex state transition graphs that represent their dynamics. This makes difficult to analyse dynamical properties. In particular, for logical models of biological…
We survey an area of recent development, relating dynamics to theoretical computer science. We discuss the theoretical limits of simulation and computation of interesting quantities in dynamical systems. We will focus on central objects of…
The theoretical and numerical understanding of the key concept of topological entropy is an important problem in dynamical systems. Most studies have been carried out on maps (discrete-time systems). We analyse a scenario of global changes…
This letter describes a method for estimating regions of attraction and bounds on permissible perturbation amplitudes in nonlinear fluids systems. The proposed approach exploits quadratic constraints between the inputs and outputs of the…
This paper introduces the \textit{truncator} map as a dynamical system on the space of configurations of an interacting particle system. We represent the symbolic dynamics generated by this system as a non-commutative algebra and classify…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…