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

DOI10.1007/S11009-014-9436-1MaRDI QIDQ292363zbMATH OpenOpenAlexFDO

Authors 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

random walkalgorithmhitting timesstationary distributionconductanceeffective resistancebirth-and-death chainsfinite treesstar graph

Mathematics Subject Classification ID

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

Recommendations

• Moments of first hitting times for birth-death processes on trees
• Birth and death processes on certain random trees: classification and stationary laws
• Birth-death processes on trees
• A note on expected hitting times for birth and death chains
• Hitting time distributions for denumerable birth and death processes
• Cut-off and escape behaviors for birth and death chains on trees
• On the distribution of random walk hitting times in random trees
• On hitting times of random walks on trees

Cites work

• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 3656855 (Why is no real title available?)
• scientific article; zbMATH DE number 1161555 (Why is no real title available?)
• A note on expected hitting times for birth and death chains
• Birth and death processes on certain random trees: classification and stationary laws
• Birth-death processes on trees
• Cut-off and escape behaviors for birth and death chains on trees
• Fast random generation of binary, t-ary and other types of trees
• On hitting times of random walks on trees

Cited in

(6)

• Cut-off and escape behaviors for birth and death chains on trees
• Reverse bisimilarity vs. forward bisimilarity
• On cover times of Markov chains
• Finite family trees of continuous time birth and death processes for evaluating the transmitting speed of information on communication networks
• Family trees of continuous-time birth-and-death processes
• Symmetry in the Green's function for birth-death chains

Describes a project that uses

Uses Software

• JDQR
• JDQZ
• CSparse

This page was built for publication: Birth and death chains on finite trees: computing their stationary distribution and hitting times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q292363)