The chaos game on a general iterated function system
-
Altmetric Citations
Barnsley, Michael; vince, Andrew
Description
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.
Collections | ANU Research Publications |
---|---|
Date published: | 2011 |
Type: | Journal article |
URI: | http://hdl.handle.net/1885/63880 |
Source: | Ergodic Theory and Dynamical Systems |
DOI: | 10.1017/S0143385710000428 |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Barnsley_The_chaos_game_on_a_general_2011.pdf | 121.84 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator