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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Athreya, K., & Ney, P. (1971). Branching processes. Berlin: Springer.
Bright, L., & Taylor, P. (1995). Calculating the equilibrium distribution in level-dependent quasi-birth-and-death processes. Communications in Statistics. Stochastic Models, 11, 497–525.
Dorman, K., Sinsheimer, J., & Lange, K. (2004). In the garden of branching processes. SIAM Review, 46, 202–229.
Harris, T. (1963). The theory of branching processes. Berlin: Springer.
Kontoleon, N. (2005). The Markovian binary tree: a model of macroevolution. PhD thesis, The University of Adelaide, Adelaide, S.A. 5005.
Latouche, G., & Ramaswami, V. (1999). Introduction to matrix analytic methods in stochastic modelling. Philadelphia: ASA SIAM.
Latouche, G., Remiche, M.-A., & Taylor, P. G. (2003). Transient Markov arrival processes. Annals of Applied Probability, 13, 628–640.
Lucantoni, D. (1991). New results on the single server queue with a batch Markovian arrival process. Communications in Statistics. Stochastic Models, 7, 1–46.
Mooers, A. O., & Heard, S. B. (1997). Inferring evolutionary processes from phylogenetic tree shape. The Quarterly Review of Biology, 71, 31–54.
Neuts, M. (1976). Moment formulas for the Markov renewal branching process. Advances in Applied Probability, 8, 690–711.
Neuts, M. (1979). A versatile Markovian point process. Journal of Applied Probability, 16, 764–779.
Neuts, M. F. (1981). Matrix-geometric solutions in stochastic models. Baltimore: John Hopkins Press.
Pinelis, I. (2003). Evolutionary models of phylogenetic trees. Proceedings of the Royal Society Statistical Society of London, 203, 1425–1431. Appendix A available online at http://journals.royalsoc.ac.uk/app/home/contribution.asp?wasp=a8dec894974947a5b93cf7579dc72f2e&referrer-parent&backto=issue,15,15;journal,60,206;homemainpublications,6,7;.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bean, N.G., Kontoleon, N. & Taylor, P.G. Markovian trees: properties and algorithms. Ann Oper Res 160, 31–50 (2008). https://doi.org/10.1007/s10479-007-0295-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0295-9