IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v74y1998i1p53-65.html
   My bibliography  Save this article

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

Author

Listed:
  • Orzechowski, M. E.

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.

Suggested Citation

  • Orzechowski, M. E., 1998. "A lower bound on the box-counting dimension of crossings in fractal percolation," Stochastic Processes and their Applications, Elsevier, vol. 74(1), pages 53-65, May.
  • Handle: RePEc:eee:spapps:v:74:y:1998:i:1:p:53-65
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304-4149(97)00117-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chayes, L., 1996. "On the length of the shortest crossing in the super-critical phase of Mandelbrot's percolation process," Stochastic Processes and their Applications, Elsevier, vol. 61(1), pages 25-43, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:74:y:1998:i:1:p:53-65. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.