Scale-free networks generated by random walkers

    Research output: Contribution to journalArticleScientificpeer-review

    79 Citations (Scopus)

    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. (C) 2004 Elsevier B.V. All rights reserved.
    Original languageEnglish
    Pages (from-to)80-86
    JournalPhysica A: Statistical Mechanics and its Applications
    Volume341
    Issue number1-4
    DOIs
    Publication statusPublished - 2004
    MoE publication typeA1 Journal article-refereed

    Keywords

    • disordered system
    • networks
    • random walks
    • scale-free networks

    Fingerprint Dive into the research topics of 'Scale-free networks generated by random walkers'. Together they form a unique fingerprint.

    Cite this