A Technique for Lower Bounding the Cover Time
From MaRDI portal
Publication:3989014
DOI10.1137/0405007zbMath0743.60068OpenAlexW2138144746MaRDI QIDQ3989014
Publication date: 28 June 1992
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/019c97e89307b3e08793cc21c797169674fdd2e1
stationary distributionvertex transitiveexpected hitting timescovering times of random walks on graphs
Related Items
Memory Efficient Anonymous Graph Exploration, Threshold limits for cover times, On an epidemic model on finite graphs, The electrical resistance of a graph captures its commute and cover times, A tight lower bound on the cover time for random walks on graphs, Hitting times for random walks on tricyclic graphs, Cover times, blanket times, and majorizing measures, Exponential concentration of cover times, A model of self‐avoiding random walks for searching complex networks, Tight bounds for the cover time of multiple random walks, Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time, Does adding more agents make a difference? A case study of cover time for the rotor-router, Random walk covering of some special trees
