Markovian trees: Properties and algorithms

DOI10.1007/s10479-007-0295-9zbMath1213.60133WikidataQ58645482 ScholiaQ58645482MaRDI QIDQ928198

Nigel G. Bean, Peter G. Taylor, Nectarios Kontoleon

Publication date: 11 June 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0295-9

zbMATH Keywords

branching processes; matrix analytic methods

Mathematics Subject Classification ID

05C05: Trees

60J80: Branching processes (Galton-Watson, birth-and-death, etc.)

Related Items

On the solution of a quadratic vector equation arising in Markovian Binary Trees, Lyapunov exponents for branching processes in a random environment: the effect of information, Algorithmic approach to the extinction probability of branching processes, Newton's iteration for the extinction probability of a Markovian binary tree, On the link between Markovian trees and tree-structured Markov chains, Quadratic vector equations, Markovian Trees Subject to Catastrophes: Would They Survive Forever?, Markovian Trees Subject to Catastrophes: Transient Features and Extinction Probability, Extinction Probabilities of Supercritical Decomposable Branching Processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transient Markov arrival processes
• New results on the single server queue with a batch markovian arrival process
• A versatile Markovian point process
• Moment formulas for the Markov renewal branching process
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• In the Garden of Branching Processes
• Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes