Birth and death chains on finite trees: computing their stationary distribution and hitting times

DOI10.1007/s11009-014-9436-1zbMath1339.60124OpenAlexW2158686591MaRDI QIDQ292363

José Luis Palacios, Daniel A. Quiroz

Publication date: 8 June 2016

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: http://eprints.lse.ac.uk/66937/1/Quiroz_Birth%20and%20death.pdf

zbMATH Keywords

algorithmhitting timesstationary distributionrandom walkstar grapheffective resistanceconductancebirth-and-death chainsfinite trees

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Numerical analysis or methods applied to Markov chains (65C40) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items

Reverse bisimilarity vs. forward bisimilarity ⋮ Symmetry in the Green's function for birth-death chains

Uses Software

• JDQR
• JDQZ
• CSparse

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast random generation of binary, t-ary and other types of trees
• Birth-death processes on trees
• On hitting times of random walks on trees
• A note on expected hitting times for birth and death chains
• Birth and death processes on certain random trees: classification and stationary laws
• Cut-off and Escape Behaviors for Birth and Death Chains on Trees