The following pages link to Threshold limits for cover times (Q2638665):
Displayed 25 items.
- Random subcube intersection graphs. I: Cliques and covering (Q311574) (← links)
- Gumbel fluctuations for cover times in the discrete torus (Q389274) (← links)
- Uniformity of the uncovered set of random walk and cutoff for lamplighter chains (Q414277) (← links)
- Cover times, blanket times, and majorizing measures (Q431644) (← links)
- Regret bounds for restless Markov bandits (Q465253) (← links)
- Uniformity of the late points of random walk on \({\mathbb {Z}}_{n}^{d}\) for \(d \geq 3\) (Q525104) (← links)
- Random walk covering of some special trees (Q809480) (← links)
- Covering with blocks in the non-symmetric case (Q1345083) (← links)
- Cut-off for lamplighter chains on tori: dimension interpolation and phase transition (Q1729703) (← links)
- Frogs on trees? (Q1748920) (← links)
- Exponential concentration of cover times (Q1748936) (← links)
- Cover times for words in symmetric and nonsymmetric cases: A comparison (Q1917614) (← links)
- Linear cover time is exponentially unlikely (Q1939561) (← links)
- Limit law for the cover time of a random walk on a binary tree (Q2041823) (← links)
- Exceptional points of two-dimensional random walks at multiples of the cover time (Q2139995) (← links)
- Some inequalities for reversible Markov chains and branching random walks via spectral optimization (Q2157453) (← links)
- On an epidemic model on finite graphs (Q2180383) (← links)
- A spectral characterization for concentration of the cover time (Q2209316) (← links)
- Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees (Q2447331) (← links)
- Speed and concentration of the covering time for structured coupon collectors (Q5005019) (← links)
- Minimization of spatial cover times for impaired self-avoiding random walks: the mirage effect (Q5006961) (← links)
- Covering a compact space by fixed-radius or growing random balls (Q5093989) (← links)
- Many Random Walks Are Faster Than One (Q5199503) (← links)
- How information prospection facilitates spatial coverage of self-avoiding walks (Q5860297) (← links)
- Exceptional points of discrete-time random walks in planar domains (Q6136838) (← links)