Scale-free networks generated by random walkers

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 γ=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.

MoreLess

Year of publication:	2004
Authors:	Saramäki, Jari ; Kaski, Kimmo
Published in:	Physica A: Statistical Mechanics and its Applications. - Elsevier, ISSN 0378-4371. - Vol. 341.2004, C, p. 80-86
Publisher:	Elsevier
Subject:	Disordered system \| Networks \| Scale-free networks \| Random walks

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011061316