An entropic proof of cutoff on Ramanujan graphs (Q829365): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2009.00837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing mixing times on sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutoff for nonbacktracking random walks on sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on the random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutoff at the ``entropic time'' for sparse Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3891523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Alon’s second eigenvalue conjecture and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutoff for Ramanujan graphs via degree inflation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on discrete groups: Boundary and entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutoff on all Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:53, 25 July 2024

scientific article
Language Label Description Also known as
English
An entropic proof of cutoff on Ramanujan graphs
scientific article

    Statements

    Identifiers

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