Random fractals and tree-indexed Markov chains
Probability
2007-09-25 v1
Abstract
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 Moran-like deterministic or random recursive constructions considered by various authors. Among other applications, we consider various extensions of Mandelbrot's fractal percolation process.
Cite
@article{arxiv.0709.3598,
title = {Random fractals and tree-indexed Markov chains},
author = {Arnaud Durand},
journal= {arXiv preprint arXiv:0709.3598},
year = {2007}
}
Comments
30 pages