Skip navigation
Skip navigation

The chaos game on a general iterated function system

Barnsley, Michael; vince, Andrew


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.

CollectionsANU Research Publications
Date published: 2011
Type: Journal article
Source: Ergodic Theory and Dynamical Systems
DOI: 10.1017/S0143385710000428


File Description SizeFormat Image
01_Barnsley_The_chaos_game_on_a_general_2011.pdf121.84 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator