uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Dimensions of random affine code tree fractals
Show others and affiliations
2014 (English)In: Ergodic Theory and Dynamical Systems, ISSN 0143-3857, E-ISSN 1469-4417, Vol. 34, 854-875 p.Article in journal (Refereed) Published
Abstract [en]

We study the dimension of code tree fractals, a class of fractals generated by a set of iterated function systems. We first consider deterministic affine code tree fractals, extending to the code tree fractal setting the classical result of Falconer and Solomyak on the Hausdorff dimension of self-affine fractals generated by a single iterated function system. We then calculate the almost sure Hausdorff, packing and box counting dimensions of a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random V-variable and homogeneous Markov constructions.

Place, publisher, year, edition, pages
2014. Vol. 34, 854-875 p.
National Category
URN: urn:nbn:se:uu:diva-229458DOI: 10.1017/etds.2012.168ISI: 000338295300009OAI: oai:DiVA.org:uu-229458DiVA: diva2:736617
Available from: 2014-08-07 Created: 2014-08-07 Last updated: 2014-08-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Stenflo, Örjan
By organisation
Department of Mathematics
In the same journal
Ergodic Theory and Dynamical Systems

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 190 hits
ReferencesLink to record
Permanent link

Direct link