Date of Original Version
Copyright © 2010 Society for Industrial and Applied Mathematics
Abstract or Description
If m ≥ 2 is constant and 0 ≤ r ≤ ε log log n for a small positive constant ε, then whp a random walk with look-ahead r on a scale-free graph G = G(m,n) has cover time CG(r) ∼ (2/(mr−1 (m − 1))) n log n.
SIAM Journal on Discrete Mathematics, 24, 3, 1162-1176.