Random Walks with Look-ahead in Scale-free Random Graphs

2010-03-20T00:00:00Z (GMT) by Colin Cooper Alan Frieze

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.