Scale-free networks generated by random walkers

Jari Saramäki and Kimmo Kaski

Physica A: Statistical Mechanics and its Applications, 2004, vol. 341, issue C, 80-86

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 γ=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: Disordered system; Networks; Scale-free networks; Random walks (search for similar items in EconPapers)
Date: 2004
References: View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437104005503
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:341:y:2004:i:c:p:80-86

DOI: 10.1016/j.physa.2004.04.110

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().