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

Itô's excursion theory and random trees

Author

Listed:
  • Le Gall, Jean-François

Abstract

We explain how Itô's excursion theory can be used to understand the asymptotic behavior of large random trees. We provide precise statements showing that the rescaled contour of a large Galton-Watson tree is asymptotically distributed according to Itô's excursion measure. As an application, we provide a simple derivation of Aldous' theorem stating that the rescaled contour function of a Galton-Watson tree conditioned to have a fixed large progeny converges to a normalized Brownian excursion. We also establish a similar result for a Galton-Watson tree conditioned to have a fixed large height.

Suggested Citation

  • Le Gall, Jean-François, 2010. "Itô's excursion theory and random trees," Stochastic Processes and their Applications, Elsevier, vol. 120(5), pages 721-749, May.
  • Handle: RePEc:eee:spapps:v:120:y:2010:i:5:p:721-749
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304-4149(10)00024-4
    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. Watanabe, Shinzo, 2010. "Itô's theory of excursion point processes and its developments," Stochastic Processes and their Applications, Elsevier, vol. 120(5), pages 653-677, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Normand, Raoul, 2014. "Two population models with constrained migrations," Stochastic Processes and their Applications, Elsevier, vol. 124(5), pages 1773-1812.
    2. Bertoin, Jean, 2010. "A limit theorem for trees of alleles in branching processes with rare neutral mutations," Stochastic Processes and their Applications, Elsevier, vol. 120(5), pages 678-697, May.

    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. Anna Ananova & Rama Cont & Renyuan Xu, 2020. "Model-free Analysis of Dynamic Trading Strategies," Papers 2011.02870, arXiv.org, revised Aug 2023.
    2. Bertoin, Jean, 2010. "A limit theorem for trees of alleles in branching processes with rare neutral mutations," Stochastic Processes and their Applications, Elsevier, vol. 120(5), pages 678-697, May.

    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:120:y:2010:i:5:p:721-749. 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.