Related papers: On the chaos game of Iterated Function Systems
Under what conditions do the behaviors of players, who play a game repeatedly, converge to a Nash equilibrium? If one assumes that the players' behavior is a discrete-time or continuous-time rule whereby the current mixed strategy profile…
This paper introduces indefinite proximities inherent in the collection of physical objects found in a dynamical system. Axiomatically, these indefinite proximities lead to a new form of Hausdorff topology, which is indefinite…
In this paper we discuss a new method to blend fractal attractors using the code map for the IFS formed by the Hutchinson--Barnsley operators of a finite family of hyperbolic IFSs. We introduce a parameter called blending coefficient to…
In some maps the existence of an attractor with a positive Lyapunov exponent can be proved by constructing a trapping region in phase space and an invariant expanding cone in tangent space. If this approach fails it may be possible to adapt…
Machine learning processes, e.g. ''learning in games'', can be viewed as non-linear dynamical systems. In general, such systems exhibit a wide spectrum of behaviors, ranging from stability/recurrence to the undesirable phenomena of chaos…
We prove that spiral sinks (stable foci of vector fields) can be transformed into strange attractors exhibiting sustained, observable chaos if subjected to periodic pulsatile forcing. We show that this phenomenon occurs in the context of…
The number of quantifiers needed to express first-order properties is captured by two-player combinatorial games called multi-structural (MS) games. We play these games on linear orders and strings, and introduce a technique we call…
Global random attractors and random point attractors for random dynamical systems have been studied for several decades. Here we introduce two intermediate concepts: $\Delta$-attractors are characterized by attracting all deterministic…
Inspired by the algorithm of Barnsley's chaos game, we construct an open quantum system model based on the repeated interaction process. We shown that the quantum dynamics of the appropriate fermionic/bosonic system (in interaction with an…
We derive quantitative sufficient conditions for rotational chaos and diffusion in annular homeomorphisms, building on the topological criteria established in [31]. These conditions depend only on basic properties of the maps, making their…
In this paper we will introduce the methodology of analysis of the convex hull of the attractors of iterated functional systems (IFS) - compact fixed sets of self-similarity mapping. The method is based on a function which for a direction,…
We prove a quantitative distortion theorem for iterated function systems that generate sets of continued fractions. As a consequence, we obtain upper and lower bounds on the Hausdorff dimension of any set of real or complex continued…
Given a self-similar set $\Lambda$ that is the attractor of an iterated function system (IFS) $\{f_1,\dots,f_N\}$, consider the following method for constructing a random subset of $\Lambda$: Let $\mathbf{p}=(p_1,\dots,p_N)$ be a…
We already know a great deal about dynamical systems with uniqueness in forward time. Indeed, flows, semiflows, and maps (both invertible and not) have been studied at length. A view that has proven particularly fruitful is topological:…
We conceive finite automata as dynamical systems on discontinuum and investigate their factors. Factors of finite automata include many well-known simple dynamical systems, e.g. hyperbolic systems and systems with finite attractors. In the…
Infinite-state games are a commonly used model for the synthesis of reactive systems with unbounded data domains. Symbolic methods for solving such games need to be able to construct intricate arguments to establish the existence of winning…
Recurrence problems are fundamental in dynamics, and for example, sizes of the set of points recurring infinitely often to a target have been studied extensively in many contexts. For example, the problem of finding the dimension for…
We investigate Tree Iterated Function Systems (TIFSs), which we introduce in this paper. TIFSs are the generalizations of Iterated Function Systems in which we take the maps independently at each step and each block. In this paper, we give…
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…
This paper develops a theory of propagation of chaos for a system of weakly interacting particles whose terminal configuration is fixed as opposed to the initial configuration as customary. Such systems are modeled by backward stochastic…