IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v8y2006i2d10.1007_s11009-006-8549-6.html
   My bibliography  Save this article

Number of Complete N-ary Subtrees on Galton-Watson Family Trees

Author

Listed:
  • George P. Yanev

    (University of South Florida)

  • Ljuben Mutafchiev

    (American University in Bulgaria
    Institute of Mathematics and Informatics of the Bulgarian Academy of Sciences)

Abstract

We associate with a Bienaymé-Galton-Watson branching process a family tree rooted at the ancestor. For a positive integer $$N$$ , define a complete $$N$$ -ary tree to be the family tree of a deterministic branching process with offspring generating function $$s^N$$ . We study the random variables $$V_{N,n}$$ and $$V_N$$ counting the number of disjoint complete $$N$$ -ary subtrees, rooted at the ancestor, and having height $$n$$ and $$\infty$$ , respectively. Dekking (1991) and Pakes and Dekking (1991) find recursive relations for $$P(V_{N,n}>0)$$ and $$P(V_N>0)$$ involving the offspring probability generation function (pgf) and its derivatives. We extend their results determining the probability distributions of $$V_{N,n}$$ and $$V_N$$ . It turns out that they can be expressed in terms of the offspring pgf, its derivatives, and the above probabilities. We show how the general results simplify in case of fractional linear, geometric, Poisson, and one-or-many offspring laws.

Suggested Citation

  • George P. Yanev & Ljuben Mutafchiev, 2006. "Number of Complete N-ary Subtrees on Galton-Watson Family Trees," Methodology and Computing in Applied Probability, Springer, vol. 8(2), pages 223-233, June.
  • Handle: RePEc:spr:metcap:v:8:y:2006:i:2:d:10.1007_s11009-006-8549-6
    DOI: 10.1007/s11009-006-8549-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-006-8549-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11009-006-8549-6?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.

    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:spr:metcap:v:8:y:2006:i:2:d:10.1007_s11009-006-8549-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.