Scale-Free Networks Generated By Random Walkers
Statistical Mechanics
2007-05-23 v1 Disordered Systems and Neural Networks
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.
Keywords
Cite
@article{arxiv.cond-mat/0404088,
title = {Scale-Free Networks Generated By Random Walkers},
author = {Jari Saramaki and Kimmo Kaski},
journal= {arXiv preprint arXiv:cond-mat/0404088},
year = {2007}
}
Comments
10 pages, 3 figures