The chaos game on a general iterated function system
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|
|Source:||Ergodic Theory and Dynamical Systems|
|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.