Exit frequency matrices for finite Markov chains

DOI10.1017/S0963548310000118MaRDI QIDQ4933599zbMATHFDO

Authors Andrew Beveridge, László Lovász

Publication date 14 October 2010

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

mixing timefinite irreducible Markov chainexit frequency matrixforget timereset timereverse Markov chain

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• scientific article; zbMATH DE number 1263183
• Reverse Process of Absorbing Markov Chains withrAbsorbing States
• Reversal of Markov Chains and the Forget Time
• On time duality for Markov chains
• Strong stationary duality for continuous-time Markov chains. I: Theory

Cites work

• scientific article; zbMATH DE number 1286465 (Why is no real title available?)
• Centers for random walks on trees
• Collisions Among Random Walks on a Graph
• Finite Markov Chains and Algorithmic Applications
• Mixing times for uniformly ergodic Markov chains
• Occupation measures for Markov chains
• Reversal of Markov Chains and the Forget Time
• Simultaneous equations models in applied search theory

Cited in

(3)

• A hitting time formula for the discrete Green's function
• Dual and Feller-Reuter-Riley transition functions
• Exact mixing times for random walks on trees

This page was built for publication: Exit frequency matrices for finite Markov chains

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