We consider several dierent models for generating random fractals including random self-similar sets, random self-affine carpets, and Mandelbrot percolation. In each setting we compute either the almost sure or the Baire typical Assouad dimension and consider some illustrative examples. Our results reveal a phenomenon common to each of our models: the Assouad dimension of a randomly generated fractal is generically as big as possible and does not depend on the measure theoretic or topological structure of the sample space. This is in stark contrast to the other commonly studied notions of dimension like the Hausdor or packing dimension
A random iterated function system (RIFS) is a finite set of (deterministic) iterated function system...
Historically, the Assouad dimension has been important in the study of quasi-conformal map-pings and...
We study some properties of a class of random connected planar fractal sets induced by a Poissonian ...
JMF was financially supported by the EPSRC grant EP/J013560/1 whilst employed at the University of W...
Abstract. The purpose of this note is to calculate the almost sure Hausdorff dimension of uniformly ...
We investigate several aspects of the Assouad dimension and the lower dimension, which together form...
This thesis is structured as follows. Chapter 1 introduces fractal sets before recalling basic math...
Abstract. We investigate several aspects of the Assouad dimension and the lower dimension, which tog...
The Assouad dimension is a measure of the complexity of a fractal set similar to the box counting di...
Abstract We characterize the existence of certain geometric configurations in the fractal percolati...
AbstractThis paper studies the Hausdorff dimensions of random non-self-similar fractals. Here, we ob...
We consider random fractal sets with random recursive constructions in which the contracting vectors...
In this article a collection of random self-similar fractal dendrites is constructed, and their Haus...
The (constructive Hausdorff) dimension of a point x in Euclidean space is the algorithmic informati...
In a previous paper we introduced a new `dimension spectrum', motivated by the Assouad dimension, de...
A random iterated function system (RIFS) is a finite set of (deterministic) iterated function system...
Historically, the Assouad dimension has been important in the study of quasi-conformal map-pings and...
We study some properties of a class of random connected planar fractal sets induced by a Poissonian ...
JMF was financially supported by the EPSRC grant EP/J013560/1 whilst employed at the University of W...
Abstract. The purpose of this note is to calculate the almost sure Hausdorff dimension of uniformly ...
We investigate several aspects of the Assouad dimension and the lower dimension, which together form...
This thesis is structured as follows. Chapter 1 introduces fractal sets before recalling basic math...
Abstract. We investigate several aspects of the Assouad dimension and the lower dimension, which tog...
The Assouad dimension is a measure of the complexity of a fractal set similar to the box counting di...
Abstract We characterize the existence of certain geometric configurations in the fractal percolati...
AbstractThis paper studies the Hausdorff dimensions of random non-self-similar fractals. Here, we ob...
We consider random fractal sets with random recursive constructions in which the contracting vectors...
In this article a collection of random self-similar fractal dendrites is constructed, and their Haus...
The (constructive Hausdorff) dimension of a point x in Euclidean space is the algorithmic informati...
In a previous paper we introduced a new `dimension spectrum', motivated by the Assouad dimension, de...
A random iterated function system (RIFS) is a finite set of (deterministic) iterated function system...
Historically, the Assouad dimension has been important in the study of quasi-conformal map-pings and...
We study some properties of a class of random connected planar fractal sets induced by a Poissonian ...