Scale-Free Networks Generated By Random Walkers
arXiv:cond-mat/0404088 · doi:10.1016/j.physa.2004.04.110
Abstract
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.
10 pages, 3 figures