Random Walks with Look-Ahead in Scale-Free Random Graphs

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.

• Type: Journal
• Year: 2010
• Where: SIAMDM
• Authors: Colin Cooper, Alan M. Frieze
• Keywords: Random Walk, Scale-free Graph, SIAMDM 2010, Small Positive Constant