Article thumbnail

Random Iteration Algorithm for Graph-Directed Sets

By Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi and Hideki Tsuiki

Abstract

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.

Year: 2012
OAI identifier: oai:CiteSeerX.psu:10.1.1.211.5343
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://drops.dagstuhl.de/opus/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.