Exit Frequency Matrices for Finite Markov Chains

DOI10.1017/S0963548310000118zbMath1226.60097MaRDI QIDQ4933599

Andrew Beveridge

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)

Related Items (2)

Exact mixing times for random walks on trees ⋮ A Hitting Time Formula for the Discrete Green's Function

Cites Work

• Simultaneous equations models in applied search theory
• Mixing times for uniformly ergodic Markov chains
• Collisions Among Random Walks on a Graph
• Occupation measures for Markov chains
• Reversal of Markov Chains and the Forget Time
• Finite Markov Chains and Algorithmic Applications
• Centers for Random Walks on Trees
• Unnamed Item

This page was built for publication: Exit Frequency Matrices for Finite Markov Chains