Sensitivity of Mixing Times in Eulerian Digraphs (Q4609786): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Card shuffling and Diophantine approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing time bounds via the spectral profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cover time of random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4767350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Walk: A Modern Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Aspects of Mixing Times in Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing times are hitting times of large sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085017 / rank
 
Normal rank

Revision as of 08:22, 15 July 2024

scientific article; zbMATH DE number 6852742
Language Label Description Also known as
English
Sensitivity of Mixing Times in Eulerian Digraphs
scientific article; zbMATH DE number 6852742

    Statements

    Sensitivity of Mixing Times in Eulerian Digraphs (English)
    0 references
    0 references
    0 references
    0 references
    26 March 2018
    0 references
    random walk
    0 references
    mixing time
    0 references
    Eulerian digraph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references