DagSemProc.07461.9.pdf
- Filesize: 191 kB
- 3 pages
Document
Matrix Analytic Methods in Branching processes
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 7461
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2008-04-07
Cite AsGet BibTex
Sophie Hautphenne, Guy Latouche, and Marie-Ange Remiche. Matrix Analytic Methods in Branching processes. In Numerical Methods for Structured Markov Chains. Dagstuhl Seminar Proceedings, Volume 7461, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.07461.9
https://doi.org/10.4230/DagSemProc.07461.9
Abstract
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.
Keywords
- Branching Processes
- Matrix Analytic Methods
- Extinction Probability
- Catastrophe Process
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads