Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Markovian trees: properties and algorithms|
|Citation:||Annals of Operations Research, 2008; 160(1):31-50|
|Publisher:||Kluwer Academic Publishers|
|Nigel G. Bean, Nectarios Kontoleon and Peter G. Taylor|
|Abstract:||In this paper we introduce a structure called the Markovian tree (MT). We define the MT and explore its alternative representation as a continuous-time Markovian Multitype Branching Process. We then develop two algorithms, the Depth and Order algorithms to determine the probability of eventual extinction of the MT process. We show that both of these algorithms have very natural physically intuitive interpretations and are analogues of the Neuts and U algorithms in Matrix-analytic Methods. Furthermore, we show that a special case of the Depth algorithm sheds new light on the interpretation of the sample paths of the Neuts algorithm.|
|Keywords:||Branching processes; Matrix analytic methods|
|Description:||The original publication can be found at www.springerlink.com|
|Provenance:||Published online: 6 December 2007|
|Appears in Collections:||Mathematical Sciences publications|
Environment Institute publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.