IDEAS home Printed from https://ideas.repec.org/a/hin/jnijsa/614917.html
   My bibliography  Save this article

Conditional limit theorems for branching processes

Author

Listed:
  • Lajos Takács

Abstract

Let [ ξ ( m ) , m = 0 , 1 , 2 , … ] be a branching process in which each individual reproduces independently of the others and has probability p j ( j = 0 , 1 , 2 , … ) of giving rise to j descendants in the following generation. The random variable ξ ( m ) is the number of individuals in the m th generation. It is assumed that P { ξ ( 0 ) = 1 } = 1 . Denote by ρ the total progeny, μ , the time of extinction, and τ , the total number of ancestors of all the individuals in the process. This paper deals with the distributions of the random variables ξ ( m ) , μ and τ under the condition that ρ = n and determines the asymptotic behavior of these distributions in the case where n → ∞ and m → ∞ in such a way that m / n tends to a finite positive limit.

Suggested Citation

  • Lajos Takács, 1991. "Conditional limit theorems for branching processes," International Journal of Stochastic Analysis, Hindawi, vol. 4, pages 1-30, January.
  • Handle: RePEc:hin:jnijsa:614917
    DOI: 10.1155/S1048953391000217
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/IJSA/4/614917.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/IJSA/4/614917.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/S1048953391000217?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
    ---><---

    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:hin:jnijsa:614917. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.