Random Iteration Algorithm for Graph-Directed Sets

Tsujii, Yoshiki; Mori, Takakazu; Yasugi, Mariko; Tsuiki, Hideki

doi:10.4230/OASIcs.CCA.2009.2275

Document

Random Iteration Algorithm for Graph-Directed Sets

Authors Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hideki Tsuiki

Part of: Volume: 6th International Conference on Computability and Complexity in Analysis (CCA'09) (CCA 2009)
Part of: Series: Open Access Series in Informatics (OASIcs)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2009-11-25

PDF

File

PDF

OASIcs.CCA.2009.2275.pdf

Filesize: 384 kB
12 pages

Document Identifiers

DOI: 10.4230/OASIcs.CCA.2009.2275
URN: urn:nbn:de:0030-drops-22759

Subject Classification

Keywords

Random iteration algorithms
graph-directed sets
displaying fractals
invariant probability measures

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get BibTex

Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, and Hideki Tsuiki. Random Iteration Algorithm for Graph-Directed Sets. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 245-256, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009) https://doi.org/10.4230/OASIcs.CCA.2009.2275

Author Details

Yoshiki Tsujii

Takakazu Mori

Mariko Yasugi

Hideki Tsuiki

Any Issues?

Feedback on the Current Page

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail