摘要：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
Loading...
