Dimensions of random affine code tree fractals
- 30 January 2013
- journal article
- research article
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 34 (3) , 854-875
Abstract
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.
Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- -variable fractals: dimension resultsForum Mathematicum, 2012
- RANDOM SUBSETS OF SELF‐AFFINE FRACTALSMathematika, 2009
- V-variable fractals: Fractals with partial self similarityAdvances in Mathematics, 2008
- A FRACTAL VALUED RANDOM ITERATION ALGORITHM AND FRACTAL HIERARCHYFractals, 2005
- ON THE DIMENSION OF SELF-SIMILAR SETSFractals, 2002
- Measure and dimension for some fractal familiesMathematical Proceedings of the Cambridge Philosophical Society, 1998
- Sub-self-similar setsTransactions of the American Mathematical Society, 1995
- The Hausdorff dimension of self-affine fractalsMathematical Proceedings of the Cambridge Philosophical Society, 1988
- Random fractalsMathematical Proceedings of the Cambridge Philosophical Society, 1986
- On a Family of Symmetric Bernoulli ConvolutionsAmerican Journal of Mathematics, 1939