Random Iteration Algorithm for Graph-Directed Sets
A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton's theorem, it is shown that almost all sequences obtained by this algorithm reflect a probability measure which is invariant with respect to the system of contractions with probabilities.
Random iteration algorithms
graph-directed sets
displaying fractals
invariant probability measures
245-256
Regular Paper
Yoshiki
Tsujii
Yoshiki Tsujii
Takakazu
Mori
Takakazu Mori
Mariko
Yasugi
Mariko Yasugi
Hideki
Tsuiki
Hideki Tsuiki
10.4230/OASIcs.CCA.2009.2275
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode