On the length of the shortest crossing in the super-critical phase of Mandelbrot's percolation process

Abstract

The fractal percolation process, which generates random subsets of the unit square, is investigated in the super-critical (percolating) regime. It is found, with probability one, that all crossing paths in the limiting set are non-rectifiable and in fact have a dimension in excess of unity.