refining bounds - cover times
arxiv.org · 8,215 words · saved by 1 readers
N/A
Exponential concentration of cover times Alex Zhai Stanford University arXiv:1407.7617v1 [math.PR] 29 Jul 2014 July 30, 2014 Abstract We prove an exponential concentration bound for cover times of general…
saved by
related reading
- Cover times - spectralarxiv.org
- Arborescences of Random Covering Graphsarxiv.org
- [2604.27639] How large part of a graph can be covered by the neighborhoods of k vertices?arxiv.org
- [2604.04115] Gallai 3-colourings of random graphsarxiv.org
- [2305.02725] Two-round Ramsey games on random graphsarxiv.org
- random subgraphs rainbowarxiv.org
- Patrick Morrissites.google.com
- Sublinear expandersias.edu
- Random Turán Problems for Graphs with a Vertex Complete to One Partarxiv.org
- piercing intervals - gyarfasarxiv.org
- rainbow-turan-full-version.pdfpeople.maths.ox.ac.uk
- Exact Stability for Turan's Theoremarxiv.org