Author:
BARNSLEY MICHAEL F.,VINCE ANDREW
Abstract
AbstractThe 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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,General Mathematics
Reference14 articles.
1. Ergodic theorem for contractive Markov systems
2. Sur les chaǐnes de variables statistiques;Onicescu;Bull. Sci. Math. France,1935
3. A classical ergodic property for IFS: a simple proof
4. Iterated function systems with continuous place dependent probabilities;Jaroszewska;Univ. Iagel. Acta Math.,2002
5. An ergodic theorem for iterated maps
Cited by
51 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献