Random Iteration Algorithm for Graph-Directed Sets

Abstract. 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.

• Type: Conference
• Year: 2009
• Where: CCA
• Authors: Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hideki Tsuiki
• Keywords: CCA 2009, Graph-directed Sets, Probability Measure, Random Iteration Algorithm, Theoretical Computer Science