paper

The Chaos Game on a General Iterated Function System

arXiv:1005.0322

Abstract

The main theorem of this paper establishes conditions under which the "chaos game" algorithm almost surely yields the attractor of an iterated function system. The theorem holds in a very general setting, even for non contractive iterated function systems, and under weaker conditions on the random orbit of the chaos game than obtained previously.

arXiv comment18 pages

References in corpus (1)