Tight inequalities among set hitting times in Markov chains

DOI10.1090/S0002-9939-2014-12045-4zbMath1300.60083arXiv1209.0039OpenAlexW2128271519MaRDI QIDQ3190216

Viresh Patel, Simon Griffiths, Ross J. Kang, Roberto Imbuzeiro Oliveira

Publication date: 16 September 2014

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

Markov chainshitting times

Mathematics Subject Classification ID

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

Related Items (7)

A threshold for cutoff in two-community random graphs ⋮ Competitive erosion is conformally invariant ⋮ The power of averaging at two consecutive time steps: proof of a mixing conjecture by Aldous and Fill ⋮ A spectral characterization for concentration of the cover time ⋮ Mixing times are hitting times of large sets ⋮ Mixing time bounds via bottleneck sequences ⋮ A technical report on hitting times, mixing and cutoff

Cites Work

• Unnamed Item
• Unnamed Item
• Mixing and hitting times for finite Markov chains
• Mixing times are hitting times of large sets
• Mixing times for uniformly ergodic Markov chains
• Some Inequalities for Reversible Markov Chains
• Maximum hitting time for random walks on graphs

This page was built for publication: Tight inequalities among set hitting times in Markov chains