arXiv · 1512.07022
The box dimension of random box-like self-affine sets
Abstract
In this paper we study two random analogues of the box-like self-affine attractors introduced by Fraser, itself an extension of Sierpiński carpets. We determine the almost sure box-counting dimension for the homogeneous random case ($1$-variable random), and give a sufficient condition for the almost sure box dimension to be the expectation of the box dimensions of the deterministic attractors. Furthermore we find the almost sure box-counting dimension of the random recursive model ($\infty$-variable), which includes affine fractal percolation.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sascha Troscheit. 2017-05-19. The box dimension of random box-like self-affine sets. https://doi.org/10.1512/iumj.2018.67.7295
Cite the original work for its findings. Save a collection to share your selection of sources.