Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

The chaos game on a general iterated function system

Thumbnail Image

Date

2011

Authors

Barnsley, Michael
vince, Andrew

Journal Title

Journal ISSN

Volume Title

Publisher

Cambridge University Press

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.

Description

Keywords

Citation

URI

http://hdl.handle.net/1885/63880

Collections

ANU Research Publications

Source

Ergodic Theory and Dynamical Systems

Type

Journal article

Book Title

Entity type

Access Statement

License Rights

DOI

10.1017/S0143385710000428

Restricted until

2037-12-31

Downloads

File
Description
01_Barnsley_The_chaos_game_on_a_general_2011.pdf (121.84 KB)

DSpace software copyright © 2002-2026 LYRASIS

abcd