Matrix Analytic Methods in Branching processes
We examine the question of solving the extinction
probability of a particular class of continuous-time multi-type
branching processes, named Markovian binary trees (MBT). The
extinction probability is the minimal nonnegative solution of a
fixed point equation that turns out to be quadratic, which makes its
resolution particularly clear.
We analyze first two linear algorithms to compute the extinction
probability of an MBT, of which one is new, and, we propose a
quadratic algorithm arising from Newton's iteration method for
fixed-point equations.
Finally, we add a catastrophe process to the
initial MBT, and we analyze the resulting system. The extinction
probability turns out to be much more difficult to compute; we use a
$G/M/1$-type Markovian process approach to approximate this
probability.
Branching Processes
Matrix Analytic Methods
Extinction Probability
Catastrophe Process
1-3
Regular Paper
Sophie
Hautphenne
Sophie Hautphenne
Guy
Latouche
Guy Latouche
Marie-Ange
Remiche
Marie-Ange Remiche
10.4230/DagSemProc.07461.9
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode