Sciweavers

CCA
2009
Springer

Random Iteration Algorithm for Graph-Directed Sets

13 years 10 months ago
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.
Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hide
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where CCA
Authors Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hideki Tsuiki
Comments (0)