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.
Sorry, we are unable to provide the full text but you may find it at the