The cover time of a (multiple) Markov chain with rational transition probabilities is rational

DOI10.1016/J.SPL.2022.109534zbMath1487.60135arXiv2102.12356OpenAlexW3129524589MaRDI QIDQ2670806

John Sylvester

Publication date: 1 June 2022

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

Full work available at URL: https://arxiv.org/abs/2102.12356

zbMATH Keywords

Markov chaincover timerational numbermultiple random walk

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites Work

• Unnamed Item
• Weakly Chained Matrices, Policy Iteration, and Impulse Control
• Many Random Walks Are Faster Than One
• The power of two choices for random walks
• Time Dependent Biased Random Walks

This page was built for publication: The cover time of a (multiple) Markov chain with rational transition probabilities is rational