par Hautphenne, Sophie 
;Latouche, Guy ;Remiche, Marie-Ange
Référence Methodology and Computing in Applied Probability
Publication Publié, 2009
;Latouche, Guy ;Remiche, Marie-Ange Référence Methodology and Computing in Applied Probability
Publication Publié, 2009
Article révisé par les pairs
| Résumé : | 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. © 2009 Springer Science+Business Media, LLC. |
