Author/Authors :
Artemi Berlinkov، نويسنده , , R. Daniel Mauldin، نويسنده ,
Abstract :
We consider random fractals generated by random recursive constructions. We prove that the box-counting and packing dimensions of these random fractals, K, equals (infinity), their almost sure Hausdorff dimension. We show that some “almost deterministic” conditions known to ensure that the Hausdorff measure satisfies 0
Keywords :
box-counting dimension , Packing measure , random strong open set condition , random fractal
Journal title :
JOURNAL OF THEORETICAL PROBABILITY
Journal title :
JOURNAL OF THEORETICAL PROBABILITY