On cover times of Markov chains

DOI10.1080/15326349.2024.2319201MaRDI QIDQ6646224

Bruno Sericola

Publication date: 29 November 2024

Published in: Stochastic Models (Search for Journal in Brave)

Mathematics Subject Classification ID

Paths and cycles (05C38) Markov processes (60Jxx) Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Birth and death chains on finite trees: computing their stationary distribution and hitting times
• The hitting and cover times of random walks on finite graphs using local degree information
• A note on expected hitting times for birth and death chains
• A note on circular Markov chains
• Expected hitting and cover times of random walks on some special graphs
• A tight upper bound on the cover time for random walks on graphs
• A tight lower bound on the cover time for random walks on graphs
• Fluctuation theory for the Ehrenfest urn via electric networks

This page was built for publication: On cover times of Markov chains

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