Sandwich theorem of cover times
From MaRDI portal
Publication:361586
DOI10.1155/2013/839846zbMath1290.05135OpenAlexW1972954392WikidataQ58999800 ScholiaQ58999800MaRDI QIDQ361586
Publication date: 29 August 2013
Published in: ISRN Probability and Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/839846
Cites Work
- Unnamed Item
- Cover times, blanket times, and majorizing measures
- Regularity of Gaussian processes
- Covering problems for Markov chains
- Lower bounds for covering times for reversible Markov chains and random walks on graphs
- Majorizing measures: The generic chaining
- The Evolution of the Cover Time
- Mean Commute Time for Random Walks on Hierarchical Scale-Free Networks
This page was built for publication: Sandwich theorem of cover times