Random fractals and tree-indexed Markov chains

Simple item page
dc.creatorDurand, Arnaud
dc.date2007-09-22
dc.date.accessioned2026-07-07T08:31:43Z
dc.date.available2026-07-07T08:31:43Z
dc.descriptionWe 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.
dc.description30 pages
dc.identifierhttps://arxiv.org/abs/0709.3598
dc.identifierhttp://arxiv.org/abs/0709.3598
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/138579
dc.subjectProbability
dc.subject60D05; 60J10; 60J80; 28A80
dc.titleRandom fractals and tree-indexed Markov chains
dc.typetext

Files

Collections

arXiv