{
  "id": "cond-mat/0404088",
  "version": "v1",
  "published": "2004-04-05T07:27:00.000Z",
  "updated": "2004-04-05T07:27:00.000Z",
  "title": "Scale-Free Networks Generated By Random Walkers",
  "authors": [
    "Jari Saramaki",
    "Kimmo Kaski"
  ],
  "comment": "10 pages, 3 figures",
  "journal": "Physica A 341, 80-86 (2004)",
  "doi": "10.1016/j.physa.2004.04.110",
  "categories": [
    "cond-mat.stat-mech",
    "cond-mat.dis-nn"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2004-04-05T07:27:00.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "random walkers",
      "mechanism produces scale-free networks",
      "sequential random walks",
      "random walk length"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 10,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}