Related papers: Projections of Mandelbrot percolation in higher di…
In this paper we study the radial and orthogonal projections and the distance sets of the random Cantor sets $E\subset \mathbb{R}^2 $ which are called Mandelbrot percolation or percolation fractals. We prove that the following assertion…
\emph{Fractal percolation} or \emph{Mandelbrot percolation} is one of the most well studied families of random fractals. In this paper we study some of the geometric measure theoretical properties (dimension of projections and structure of…
A well studied family of random fractals called fractal percolation is discussed. We focus on the projections of fractal percolation on the plane. Our goal is to present stronger versions of the classical Marstrand theorem, valid for almost…
This is a survey paper about the fractal percolation process, also known as Mandelbrot percolation. It is intended to give a general breadth overview of more recent research in the topic, but also includes some of the more classical…
In this paper we consider fractal percolation random Cantor sets $E$ on the plane constructed with non-homogeneous probabilities. We focus on the case when the probabilities are large enough to guarantee that the almost sure dimension of…
We study the porosity properties of fractal percolation sets $E\subset\mathbb{R}^d$. Among other things, for all $0<\varepsilon<\tfrac12$, we obtain dimension bounds for the set of exceptional points where the upper porosity of $E$ is less…
Our first experience of dimension typically comes in the intuitive Euclidean sense: a line is one dimensional, a plane is two-dimensional, and a volume is three-dimensional. However, following the work of Mandelbrot \cite{mandelbrot},…
We show that fractal (or "Mandelbrot") percolation in two dimensions produces a set containing no directed paths, when the set produced has zero area. This improves a similar result by the first author in the case of constant retention…
For each $k\ge 3$, we determine the dimensional threshold for planar fractal percolation to contain $k$ collinear points. In the critical case of dimension $1$, the largest linear slice of fractal percolation is a Cantor set of zero…
We survey some of our recent results on the geometry of spatially independent martingales, in a more concrete setting that allows for shorter, direct proofs, yet is general enough for several applications and contains the well-known fractal…
Fractal percolation has been introduced by Mandelbrot in 1974. We study the two-dimensional case, with integer subdivision index M and survival probability p. It is well known that there exists a non-trivial critical value p_c(M) such that…
The properties of the similarity transformation in percolation theory in the complex plane of the percolation probability are studied. It is shown that the percolation problem on a two-dimensional square lattice reduces to the Mandelbrot…
We introduce a technique that uses projection properties of fractal percolation to establish dimension conservation results for sections of deterministic self-similar sets. For example, let $K$ be a self-similar subset of $\mathbb{R}^2$…
There are various notions of dimension in fractal geometry to characterise (random and non-random) subsets of $\mathbb R^d$. In this expository text, we discuss their analogues for infinite subsets of $\mathbb Z^d$ and, more generally, for…
We study the size properties of a general model of fractal sets that are based on a tree-indexed family of random compacts and a tree-indexed Markov chain. These fractals may be regarded as a generalization of those resulting from the…
In this paper we examine a number of models that generate random fractals. The models are studied using the tools of computational complexity theory from the perspective of parallel computation. Diffusion limited aggregation and several…
In this paper we propose a new model of random graph directed fractals that extends the current well-known model of random graph directed iterated function systems, $V$-variable attractors, and fractal and Mandelbrot percolation. We study…
One of the most well known random fractals is the so-called Fractal percolation set. This is defined as follows: we divide the unique cube in $\mathbb{R}^d$ into $M^d$ congruent sub-cubes. For each of these cubes a certain retention…
In this paper we consider some families of random Cantor sets on the line and investigate the question whether the condition that the sum of Hausdorff dimension is larger than one implies the existence of interior points in the difference…
We consider an optical diffraction grating in which the spatial distribution of open slits forms a fractal set. The Fraunhofer diffraction patterns through the fractal grating are obtained analytically for the simplest triad Cantor type and…