A lower bound on the box-counting dimension of crossings in fractal percolation

M. E. Orzechowski

Stochastic Processes and their Applications, 1998, vol. 74, issue 1, 53-65

Abstract: We consider Mandelbrot's fractal percolation process, obtained by repeated subdivision of the unit square, and obtain an explicit almost sure lower bound on the lower box-counting dimension of paths within the retained set that cross the square from left to right.

Keywords: Fractal; percolation; Mandelbrot; percolation; Box-counting; dimension; Holder; exponent (search for similar items in EconPapers)
Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304-4149(97)00117-8
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:74:y:1998:i:1:p:53-65

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().