A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Eltonu27s 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.
展开▼
