The cover time of the giant component of a random graph

We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In particular we show that the cover time is not monotone for c = (ln n). We also determine the cover time of the k-cores, k 2.

• Type: Journal
• Year: 2008
• Where: RSA
• Authors: Colin Cooper, Alan M. Frieze
• Keywords: Cover Time, Largest Component, Random Walk, RSA 2008