IDEAS home Printed from https://ideas.repec.org/a/bpj/strimo/v25y2007i3-2007p19n2.html
   My bibliography  Save this article

A limit theorem for recursively defined processes in L

Author

Listed:
  • Eickmeyer Kord
  • Rüschendorf Ludger

Abstract

In this paper we derive a limit theorem for recursively defined processes. For several instances of recursive processes like for depth first search processes in random trees with logarithmic height or for fractal processes it turns out that convergence can not be expected in the space of continuous functions or in the Skorohod space D. We therefore weaken the Skorohod topology and establish a convergence result in Lp spaces in which D is continuously imbedded. The proof of our convergence result is based on an extension of the contraction method. An application of the limit theorem is given to the FIND process. The paper extends in particular results in [HR00] on the existence and uniqueness of random fractal measures and processes. The depth first search processes of Catalan and of logarithmically growing trees do however not fit the assumptions of our limit theorem and lead to the so far unsolved problem of degenerate limits.

Suggested Citation

  • Eickmeyer Kord & Rüschendorf Ludger, 2007. "A limit theorem for recursively defined processes in L," Statistics & Risk Modeling, De Gruyter, vol. 25(3/2007), pages 1-19, July.
    • Handle: RePEc:bpj:strimo:v:25:y:2007:i:3/2007:p:19:n:2
    DOI: 10.1524/stnd.2007.0901
    as

    Download full text from publisher

    File URL: https://doi.org/10.1524/stnd.2007.0901
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.
    File URL: https://libkey.io/10.1524/stnd.2007.0901?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Gutjahr, W. & Pflug, G. Ch., 1992. "The asymptotic contour process of a binary tree is a Brownian excursion," Stochastic Processes and their Applications, Elsevier, vol. 41(1), pages 69-89, May.
    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.
    1. Drmota, Michael & Gittenberger, Bernhard, 1999. "Strata of random mappings - A combinatorial approach," Stochastic Processes and their Applications, Elsevier, vol. 82(2), pages 157-171, August.

    More about this item

    Statistics

    Access and download statistics

    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:bpj:strimo:v:25:y:2007:i:3/2007:p:19:n:2. 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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.com .

    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.