Exit frequency matrices for finite Markov chains

DOI10.1017/S0963548310000118zbMATH Open1226.60097MaRDI QIDQ4933599FDOQ4933599

Authors: Andrew Beveridge, László Lovász 

Publication date: 14 October 2010

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

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

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)

Cites Work

• Finite Markov Chains and Algorithmic Applications
• 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
• Centers for random walks on trees
• Title not available (Why is that?)
• Simultaneous equations models in applied search theory

Cited In (3)

• Dual and Feller-Reuter-Riley transition functions
• A Hitting Time Formula for the Discrete Green's Function
• 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)