eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2009-11-25
245
256
10.4230/OASIcs.CCA.2009.2275
article
Random Iteration Algorithm for Graph-Directed Sets
Tsujii, Yoshiki
Mori, Takakazu
Yasugi, Mariko
Tsuiki, Hideki
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.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol011-cca2009/OASIcs.CCA.2009.2275/OASIcs.CCA.2009.2275.pdf
Random iteration algorithms
graph-directed sets
displaying fractals
invariant probability measures