Birth and death chains on finite trees: computing their stationary distribution and hitting times
DOI10.1007/S11009-014-9436-1zbMATH Open1339.60124OpenAlexW2158686591MaRDI QIDQ292363FDOQ292363
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
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
random walkalgorithmhitting timesstationary distributionconductanceeffective resistancebirth-and-death chainsfinite treesstar graph
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Fast random generation of binary, t-ary and other types of trees
- Birth-death processes on trees
Cited In (6)
- 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
- Reverse bisimilarity vs. forward bisimilarity
- On cover times of Markov chains
- Cut-off and escape behaviors for birth and death chains on trees
Uses Software
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)
