Random affine code tree fractals and Falconer–Sloan condition
- 15 December 2014
- journal article
- research article
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 36 (5) , 1516-1533
Abstract
We calculate the almost sure dimension for a general class of random affine code tree fractals in $\mathbb{R}^{d}$ . The result is based on a probabilistic version of the Falconer–Sloan condition $C(s)$ introduced in Falconer and Sloan [Continuity of subadditive pressure for self-affine sets. Real Anal. Exchange 34 (2009), 413–427]. We verify that, in general, systems having a small number of maps do not satisfy condition $C(s)$ . However, there exists a natural number $n$ such that for typical systems the family of all iterates up to level $n$ satisfies condition $C(s)$ .
Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- RANDOM SUBSETS OF SELF‐AFFINE FRACTALSMathematika, 2009
- Overlapping self-affine sets of Kakeya typeErgodic Theory and Dynamical Systems, 2009
- DIMENSIONS OF SELF-AFFINE FRACTALS AND MULTIFRACTALS GENERATED BY UPPER-TRIANGULAR MATRICESFractals, 2007
- Hausdorff Dimension for Randomly Perturbed Self Affine AttractorsCommunications in Mathematical Physics, 2006
- A FRACTAL VALUED RANDOM ITERATION ALGORITHM AND FRACTAL HIERARCHYFractals, 2005
- Fractal Geometry2003
- Graph Directed Markov Systems2003
- Measure and dimension for some fractal familiesMathematical Proceedings of the Cambridge Philosophical Society, 1998
- Sub-self-similar setsTransactions of the American Mathematical Society, 1995
- Classical Descriptive Set Theory1995