Random iteration for non-expansive iterated function systems: derandomised algorithm
From MaRDI portal
Summary: A probabilistic algorithm, referred to as the `chaos game', is derandomised with the aid of deterministic symbolic sequences, known in the algorithmic complexity under the name `disjunctive words'. The deterministic algorithm is shown to work for attractors of iterated function systems comprising maps which do not increase distances.
Recommendations
- Random iteration for infinite nonexpansive iterated function systems
- A chaos game algorithm for generalized iterated function systems
- The chaos game on a general iterated function system
- "Chaos Games" for Iterated Function Systems with Grey Level Maps
- Ergodic theorem for infinite iterated function systems
Cited in
(6)- Sieving random iterative function systems
- Some stochastic properties of topological dynamics of semigroup actions
- Non-hyperbolic iterated function systems: semifractals and the chaos game
- Sporadicity: Between periodic and chaotic dynamical behaviors
- "Chaos Games" for Iterated Function Systems with Grey Level Maps
- Random iteration for infinite nonexpansive iterated function systems
This page was built for publication: Random iteration for non-expansive iterated function systems: derandomised algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q258020)