• Media type: Text; E-Article; Electronic Conference Proceeding
  • Title: Random Iteration Algorithm for Graph-Directed Sets
  • Contributor: Tsujii, Yoshiki [Author]; Mori, Takakazu [Author]; Yasugi, Mariko [Author]; Tsuiki, Hideki [Author]
  • imprint: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2009
  • Language: English
  • DOI: https://doi.org/10.4230/OASIcs.CCA.2009.2275
  • Keywords: invariant probability measures ; displaying fractals ; graph-directed sets ; Random iteration algorithms
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: 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.
  • Access State: Open Access