253 search results - page 1 / 51 » Random Walks with Look-Ahead in Scale-Free Random Graphs |
SIAMDM
2010
13 years 5 months ago
2010
If m 2 is constant and 0 r log log n for a small positive constant , then whp a random walk with look-ahead r on a scale-free graph G = G(m, n) has cover time CG(r) (2/(mr-1(...
INFOCOM
2008
IEEE
14 years 5 months ago
2008
IEEE
—In this paper, we examine the asymptotic behavior of degree correlation (i.e., the joint degree distribution of adjacent nodes) in several scale-free topology generators GED [13...
CPC
2007
13 years 11 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...
COMBINATORICA
2004
13 years 11 months ago
2004
MICS
2010
13 years 9 months ago
2010
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...