The chaos game on a general iterated function system

Michael F. Barnsley*, Andrew Vince

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    56 Citations (Scopus)

    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.

    Original languageEnglish
    Pages (from-to)1073-1079
    Number of pages7
    JournalErgodic Theory and Dynamical Systems
    Volume31
    Issue number4
    DOIs
    Publication statusPublished - Aug 2011

    Fingerprint

    Dive into the research topics of 'The chaos game on a general iterated function system'. Together they form a unique fingerprint.

    Cite this