Year: 2010
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Barnsley, Michael, Vince, Andrew
Institutions: Australian National University, University of Florida
Language: English
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2951324619