Threshold limits for cover times
From MaRDI portal
Publication:2638665
DOI10.1007/BF01047002zbMath0717.60082MaRDI QIDQ2638665
Publication date: 1991
Published in: Journal of Theoretical Probability (Search for Journal in Brave)
Geometric probability and stochastic geometry (60D05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (25)
Covering with blocks in the non-symmetric case ⋮ Exceptional points of two-dimensional random walks at multiples of the cover time ⋮ Random subcube intersection graphs. I: Cliques and covering ⋮ Some inequalities for reversible Markov chains and branching random walks via spectral optimization ⋮ Cover times for words in symmetric and nonsymmetric cases: A comparison ⋮ On an epidemic model on finite graphs ⋮ Gumbel fluctuations for cover times in the discrete torus ⋮ Linear cover time is exponentially unlikely ⋮ Uniformity of the uncovered set of random walk and cutoff for lamplighter chains ⋮ Exceptional points of discrete-time random walks in planar domains ⋮ Cover times, blanket times, and majorizing measures ⋮ A spectral characterization for concentration of the cover time ⋮ Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees ⋮ Regret bounds for restless Markov bandits ⋮ Cut-off for lamplighter chains on tori: dimension interpolation and phase transition ⋮ Frogs on trees? ⋮ Exponential concentration of cover times ⋮ Uniformity of the late points of random walk on \({\mathbb {Z}}_{n}^{d}\) for \(d \geq 3\) ⋮ Covering a compact space by fixed-radius or growing random balls ⋮ Many Random Walks Are Faster Than One ⋮ Limit law for the cover time of a random walk on a binary tree ⋮ Speed and concentration of the covering time for structured coupon collectors ⋮ Minimization of spatial cover times for impaired self-avoiding random walks: the mirage effect ⋮ How information prospection facilitates spatial coverage of self-avoiding walks ⋮ Random walk covering of some special trees
Cites Work
- Unnamed Item
- Unnamed Item
- Covering times of random walks on bounded degree trees and other graphs
- Covering problems for Markov chains
- Random walk covering of some special trees
- Deviations from uniformity in random strings
- Probability approximations via the Poisson clumping heuristic
- An introduction to covering problems for random walks on graphs
- Hitting times for random walks on vertex-transitive graphs
- A Technique for Lower Bounding the Cover Time
- Martingale Inequalities and NP-Complete Problems
This page was built for publication: Threshold limits for cover times
