Algorithmic approach to the extinction probability of branching processes

DOI10.1007/S11009-009-9141-7MaRDI QIDQ631488zbMATH OpenOpenAlexFDO

Authors Sophie Hautphenne, Guy Latouche, Marie-Ange Remiche

Publication date 14 March 2011

Published in Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11009-009-9141-7

zbMATH Keywords

branching processesextinction probabilitymatrix analytic methods

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Numerical computation of solutions to systems of equations (65H10) Population dynamics (general) (92D25)

Recommendations

• An algorithm for solving systems of quadratic equations in branching processes
• Newton's iteration for the extinction probability of a Markovian binary tree
• A polynomial time algorithm for computing extinction probabilities of multitype branching processes
• Extinction probabilities of branching processes with countably infinitely many types
• A structured Markov chain approach to branching processes

Cites work

• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• scientific article; zbMATH DE number 194776 (Why is no real title available?)
• scientific article; zbMATH DE number 3410334 (Why is no real title available?)
• scientific article; zbMATH DE number 3190745 (Why is no real title available?)
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Markovian trees: Properties and algorithms
• Newton's iteration for the extinction probability of a Markovian binary tree
• Transient Markov arrival processes
• Two servers in series, studied in terms of a Markov renewal branching process

Cited in

(20)

• On the link between Markovian trees and tree-structured Markov chains
• Computation of extinction probabilities for the Bellman-Harris branching process
• A modified Newton method for the quadratic vector equation arising in Markovian binary trees
• Determination of the degeneration probability of the Galton-Watson branching process by a method of stochastic approximation
• Convergence of relaxed Newton method for order-convex matrix equations
• Fitting Markovian binary trees using global and individual demographic data
• Convergence of the population dynamics algorithm in the Wasserstein metric
• Perturbation analysis of the extinction probability of a Markovian binary tree
• An algorithm for solving systems of quadratic equations in branching processes
• Matrix structures in queuing models
• Markovian trees subject to catastrophes: transient features and extinction probability
• Extinction Probabilities of Supercritical Decomposable Branching Processes
• A structured Markov chain approach to branching processes
• Branching processes with a common extinction probability
• scientific article; zbMATH DE number 1507353 (Why is no real title available?)
• On the solution of a quadratic vector equation arising in Markovian binary trees.
• The modified Newton-Shamanskii method for the solution of a quadratic vector equation arising in Markovian binary trees
• A polynomial time algorithm for computing extinction probabilities of multitype branching processes
• Matrix-analytic methods for the evolution of species trees, gene trees, and their reconciliation
• Newton's iteration for the extinction probability of a Markovian binary tree

This page was built for publication: Algorithmic approach to the extinction probability of branching processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631488)