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
- Arborescences of Random Covering Graphsarxiv.org
- Cover times - spectralarxiv.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
- [2603.23431] On the number of families avoiding a subposetarxiv.org
- Exact Stability for Turan's Theoremarxiv.org
- 02_GyarfasLehel_AHellyTypeProblemInTrees.pdfusers.renyi.hu
- Induced rational exponents near twoarxiv.org
- Sublinear expandersias.edu
- survey.dvimath.uchicago.edu
- Dynamical Approach to RMT.pdfpeople.math.harvard.edu
- Comparison principle for stochastic heat equation on Rdmath.emory.edu