The expected hitting times for finite Markov chains

DOI10.1016/j.laa.2008.01.003zbMath1139.60333OpenAlexW2052631868MaRDI QIDQ924349

Hai-Yan Chen, Fu Ji Zhang

Publication date: 15 May 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.01.003

zbMATH Keywords

graphMarkov chainsrandom walksthe expected hitting time

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (6)

Hitting times, number of jumps, and occupation times for continuous-time finite state Markov chains ⋮ Hitting times for random walks on subdivision and triangulation graphs ⋮ Safe navigation in adversarial environments ⋮ Expected hitting times for random walks on quadrilateral graphs and their applications ⋮ Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters ⋮ Expected hitting times for random walks on the \(k\)-triangle graph and their applications

Cites Work

• Random walks and the effective resistance of networks
• Bounds on expected hitting times for a random walk on a connected graph
• Random walks on highly symmetric graphs
• Non-negative matrices and Markov chains. 2nd ed
• Problems in algebraic combinatorics
• Regular graphs with four eigenvalues
• Finite Continuous Time Markov Chains
• Potential Theory on Distance-Regular Graphs
• A new 5‐arc‐transitive cubic graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The expected hitting times for finite Markov chains