IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v13y2011i1d10.1007_s11009-009-9141-7.html
   My bibliography  Save this article

Algorithmic Approach to the Extinction Probability of Branching Processes

Author

Listed:
  • Sophie Hautphenne

    (Université Libre de Bruxelles)

  • Guy Latouche

    (Université Libre de Bruxelles)

  • Marie-Ange Remiche

    (Université Libre de Bruxelles)

Abstract

The extinction probability of a branching process is characterized as the solution of a fixed-point equation which, for a fairly general class of Markovian branching processes, is vector quadratic. We address the question of solving that equation, using a mixture of algorithmic and probabilistic arguments. We compare the relative efficiency of three iterative methods based on functional iteration, on the basis of the probabilistic interpretation of the successive iterations as well as on the basis of traditional rate of convergence analysis. We illustrate our findings through a few numerical examples and conclude by showing how they extend to more complex systems.

Suggested Citation

  • Sophie Hautphenne & Guy Latouche & Marie-Ange Remiche, 2011. "Algorithmic Approach to the Extinction Probability of Branching Processes," Methodology and Computing in Applied Probability, Springer, vol. 13(1), pages 171-192, March.
    • Handle: RePEc:spr:metcap:v:13:y:2011:i:1:d:10.1007_s11009-009-9141-7
    DOI: 10.1007/s11009-009-9141-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-009-9141-7
    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-009-9141-7?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. Nigel Bean & Nectarios Kontoleon & Peter Taylor, 2008. "Markovian trees: properties and algorithms," Annals of Operations Research, Springer, vol. 160(1), pages 31-50, April.
    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. Hautphenne, Sophie & Massaro, Melanie & Turner, Katharine, 2019. "Fitting Markovian binary trees using global and individual demographic data," Theoretical Population Biology, Elsevier, vol. 128(C), pages 39-50.

    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. Hautphenne, Sophie & Houdt, Benny Van, 2010. "On the link between Markovian trees and tree-structured Markov chains," European Journal of Operational Research, Elsevier, vol. 201(3), pages 791-798, March.
    2. Marco Bonomelli & Rosella Giacometti & Sergio Ortobelli Lozza, 2020. "Joint tails impact in stochastic volatility portfolio selection models," Annals of Operations Research, Springer, vol. 292(2), pages 833-848, September.

    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:13:y:2011:i:1:d:10.1007_s11009-009-9141-7. 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: 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.