The Chaos Game on a General Iterated Function System
Metric Geometry
2010-05-04 v1
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.
Cite
@article{arxiv.1005.0322,
title = {The Chaos Game on a General Iterated Function System},
author = {Michael Barnsley and Andrew Vince},
journal= {arXiv preprint arXiv:1005.0322},
year = {2010}
}
Comments
18 pages