Scale-free networks generated by random walkers
Scale-free networks generated by random walkers
复制标题
DOI：
10.1016/j.physa.2004.04.110
复制
发表时间：
2004-10-01
影响因子：
3.3
通讯作者：
Kaski, K
中科院分区：
文献类型：
--
作者：
Saramäki, J;Kaski, K
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.
