Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/OASIcs.CCA.2009.2275
URN: urn:nbn:de:0030-drops-22759
URL: https://drops.dagstuhl.de/opus/volltexte/2009/2275/
Tsujii, Yoshiki ; Mori, Takakazu ; Yasugi, Mariko ; Tsuiki, Hideki
Contributed Papers
Random Iteration Algorithm for Graph-Directed Sets
| pdf-format: |
|
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.
BibTeX - Entry
@InProceedings{tsujii_et_al:OASIcs:2009:2275,
author = {Yoshiki Tsujii and Takakazu Mori and Mariko Yasugi and Hideki Tsuiki},
title = {{Random Iteration Algorithm for Graph-Directed Sets}},
booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-939897-12-5},
ISSN = {2190-6807},
year = {2009},
volume = {11},
editor = {Andrej Bauer and Peter Hertling and Ker-I Ko},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2009/2275},
URN = {urn:nbn:de:0030-drops-22759},
doi = {10.4230/OASIcs.CCA.2009.2275},
annote = {Keywords: Random iteration algorithms, graph-directed sets, displaying fractals, invariant probability measures}
}
| Keywords: | Random iteration algorithms, graph-directed sets, displaying fractals, invariant probability measures | |
| Seminar: | 6th International Conference on Computability and Complexity in Analysis (CCA'09) | |
| Issue date: | 2009 | |
| Date of publication: | 25.11.2009 |
