Crawling on Simple Models of Web Graphs

Abstract

We consider the problem of searching a randomly growing graph by a random walk. In particular we consider two simple models of "web-graphs." Thus at each time step a new vertex is added and it is connected to the current graph by randomly chosen edges. At the same time a "spider" S makes a number of steps of a random walk on the current graph. The parameter we consider is the expected proportion of vertices that have been visited by S up to time t.