9 search results - page 1 / 2 » The cover time of the preferential attachment graph |
JCT
2007
13 years 4 months ago
2007
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...
WAW
2004
Springer
13 years 10 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
NETWORKING
2011
12 years 7 months ago
2011
Abstract. In this paper we introduce Spatio-TEmporal Parametric Stepping (STEPS) - a simple parametric mobility model which can cover a ectrum of human mobility patterns. STEPS mak...
CPC
2007
13 years 4 months ago
2007
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
ICITS
2011
12 years 8 months ago
2011
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...