A note on expected hitting times for birth and death chains

DOI10.1016/0167-7152(95)00209-XzbMath0883.60081OpenAlexW2076769011MaRDI QIDQ1126106

Prasad Tetali, José Luis Palacios

Publication date: 2 June 1997

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-7152(95)00209-x

zbMATH Keywords

graphstationary distributionresistancetransitionMarkov random walk

Mathematics Subject Classification ID

Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (18)

Birth and death chains on finite trees: computing their stationary distribution and hitting times ⋮ On mixing times for stratified walks on thed-cube ⋮ The Hitting Time of Multiple Random Walks ⋮ On the first passage time of a simple random walk on a tree ⋮ Moran's genetics model via electric networks. ⋮ The cutoff phenomenon for random birth and death chains ⋮ The expected hitting times for graphs with cutpoints. ⋮ A note on circular Markov chains ⋮ Hitting times for random walks on subdivision and triangulation graphs ⋮ The Role of Kemeny's Constant in Properties of Markov Chains ⋮ Expected hitting times for random walks on quadrilateral graphs and their applications ⋮ Symmetry in the Green's function for birth-death chains ⋮ Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters ⋮ Random walks on a finite graph with congestion points ⋮ Mixing and hitting times for Gibbs samplers and other non-Feller processes ⋮ Mean unknotting times of random knots and embeddings ⋮ Expected hitting times for random walks on the \(k\)-triangle graph and their applications ⋮ Mixing times for a constrained Ising process on the two-dimensional torus at low density

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random walks and the effective resistance of networks
• Mean passage times for tridiagonal transition matrices and a two-parameter ehrenfest urn model
• Another Look at the Ehrenfest Urn Via Electric Networks
• An Extension of Foster's Network Theorem
• On a generalization of the ehrenfest urn model

This page was built for publication: A note on expected hitting times for birth and death chains