{
  "id": "cond-mat/0508434",
  "version": "v2",
  "published": "2005-08-18T18:19:06.000Z",
  "updated": "2006-05-16T15:17:25.000Z",
  "title": "Two-level relationships and Scale-Free Networks",
  "authors": [
    "F. Stauffer"
  ],
  "journal": "Physica A, 365, 565-570 (2006)",
  "doi": "10.1016/j.physa.2005.12.070",
  "categories": [
    "cond-mat.stat-mech",
    "cond-mat.dis-nn"
  ],
  "abstract": "Through the distinction between ``real'' and ``virtual'' links between the nodes of a graph, we develop a set of simple rules leading to scale-free networks with a tunable degree distribution exponent. Albeit sharing some similarities with preferential attachment, our procedure is both faster than a na\\\"ive implementation of the Barab\\'asi and Albert model and exhibits different clustering properties. The model is thoroughly studied numerically and suggests that reducing the set of partners a node can connect to is important in seizing the diversity of scale-free structures.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2006-05-16T15:17:25.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "scale-free networks",
      "two-level relationships",
      "tunable degree distribution exponent",
      "albert model",
      "preferential attachment"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}