Scale-Free Networks Generated By Random Walkers

Simple item page
dc.creatorSaramaki, Jari
dc.creatorKaski, Kimmo
dc.date2004-04-05
dc.date.accessioned2026-07-07T06:33:51Z
dc.date.available2026-07-07T06:33:51Z
dc.descriptionWe 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.
dc.description10 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0404088
dc.identifierhttp://arxiv.org/abs/cond-mat/0404088
dc.identifierPhysica A 341, 80-86 (2004)
dc.identifierdoi:10.1016/j.physa.2004.04.110
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/99331
dc.subjectStatistical Mechanics
dc.subjectDisordered Systems and Neural Networks
dc.titleScale-Free Networks Generated By Random Walkers
dc.typetext

Files

Collections

arXiv