Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4657517 | Journal of Combinatorial Theory, Series B | 2007 | 22 Pages |
Abstract
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability proportional to their degree. Thus at time n there are n vertices and mn edges. This process yields a graph which has been proposed as a simple model of the world wide web [A. Barabási, R. Albert, Emergence of scaling in random networks, Science 286 (1999) 509–512]. In this paper we show that if m⩾2 then whp the cover time of a simple random walk on Gm(n) is asymptotic to .
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics