Abstract
The preferential attachment graph G m ( 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 G m ( n ) is asymptotic to 2 m m − 1 n log n .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
