Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

JCT
2007

favoriteEmaildiscussreport

108views more JCT 2007»

The cover time of the preferential attachment graph

13 years 4 months ago

The cover time of the preferential attachment graph

Download www.math.cmu.edu

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 [2]. 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 2m m−1n log n.

Colin Cooper, Alan M. Frieze

Real-time Traffic

JCT 2007 | Preferential Attachment Graph | Random Graph | World Wide Web |

claim paper

Related Content

» A Geometric Preferential Attachment Model of Networks

» STEPS An Approach for Human Mobility Modeling

» Adversarial Deletion in a ScaleFree Random Graph Process

» Homogeneous Faults Colored Edge Graphs and Cover Free Families

» WealthBased Evolution Model for the Internet ASLevel Topology

» Understanding and modeling the internet topology economics and evolution perspective

» Local Algorithms for Finding Interesting Individuals in Large Networks

» An EconomicallyPrincipled Generative Model of AS Graph Connectivity

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JCT
Authors	Colin Cooper, Alan M. Frieze

Comments (0)