We present a simple mechanism for generating undirected scale-free networks using random walkers, where the network growth is determined by choosing parent vertices by sequential random walks. We show that this mechanism produces scale-free networks with degree exponent gamma = 3 and clustering coefficients depending on random walk length. The mechanism can be interpreted in terms of preferential attachment without explicit knowledge of node degrees. (C) 2004 Elsevier B.V. All rights reserved.
|Journal||Physica A: Statistical Mechanics and its Applications|
|Publication status||Published - 2004|
|MoE publication type||A1 Journal article-refereed|
- disordered system
- random walks
- scale-free networks