Summary: Based on a connection between cover times of graphs and Talagrand's theory of majorizing measures, we establish sandwich theorems for cover times as well as blanket times.
Cites work
- Cover times, blanket times, and majorizing measures
- Covering problems for Markov chains
- scientific article; zbMATH DE number 878897 (Why is no real title available?)
- Lower bounds for covering times for reversible Markov chains and random walks on graphs
- Majorizing measures: The generic chaining
- Mean commute time for random walks on hierarchical scale-free networks
- Regularity of Gaussian processes
- The evolution of the cover time
This page was built for publication: Sandwich theorem of cover times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q361586)
