Sandwich theorem of cover times (Q361586): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58999800, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lower bounds for covering times for reversible Markov chains and random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover times, blanket times, and majorizing measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity of Gaussian processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majorizing measures: The generic chaining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean Commute Time for Random Walks on Hierarchical Scale-Free Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering problems for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Evolution of the Cover Time / rank
 
Normal rank

Latest revision as of 19:06, 6 July 2024

scientific article
Language Label Description Also known as
English
Sandwich theorem of cover times
scientific article

    Statements

    Sandwich theorem of cover times (English)
    0 references
    0 references
    29 August 2013
    0 references
    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.
    0 references
    Talagrand's theory of majorizing measures
    0 references

    Identifiers