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

Limit theorems for sums determined by branching and other exponentially growing processes

Author

Listed:
  • Jagers, Peter
  • Nerman, Olle

Abstract

A branching process counted by a random characteristic has been defined as a process which at time t is the superposition of individual stochastic processes evaluated at the actual ages of the individuals of a branching population. Now characteristics which may depend not only on age but also on absolute time are considered. For supercritical processes a distributional limit theorem is proved, which implies that classical limit theorems for sums of characteristics evaluated at a fixed age point transfer into limit theorems for branching processes counted by these characteristics. A point is that, though characteristics of different individuals should be independent, the characteristics of an individual may well interplay with the reproduction of the latter. The result requires a sort of Lp-continuity for some 1 [less-than-or-equals, slant] p [less-than-or-equals, slant] 2. Its proof turns out to be valid for a wider class of processes than branching ones. For the case p = 1 a number of Poisson type limits follow and for p = 2 some normality approximations are concluded. For example results are obtained for processes for rare events, the age of the oldest individual, and the error of population predictions. This work has been supported by a grant from the Swedish Natural Science Research Council.

Suggested Citation

  • Jagers, Peter & Nerman, Olle, 1984. "Limit theorems for sums determined by branching and other exponentially growing processes," Stochastic Processes and their Applications, Elsevier, vol. 17(1), pages 47-71, May.
  • Handle: RePEc:eee:spapps:v:17:y:1984:i:1:p:47-71
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(84)90311-9
    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.

    Citations

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


    Cited by:

    1. Champagnat, Nicolas & Lambert, Amaury, 2013. "Splitting trees with neutral Poissonian mutations II: Largest and oldest families," Stochastic Processes and their Applications, Elsevier, vol. 123(4), pages 1368-1414.
    2. Champagnat, Nicolas & Lambert, Amaury, 2012. "Splitting trees with neutral Poissonian mutations I: Small families," Stochastic Processes and their Applications, Elsevier, vol. 122(3), pages 1003-1033.

    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:17:y:1984:i:1:p:47-71. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.