{
  "id": "cond-mat/0507525",
  "version": "v2",
  "published": "2005-07-22T13:19:35.000Z",
  "updated": "2006-01-03T11:23:04.000Z",
  "title": "An algorithm for counting circuits: application to real-world and random graphs",
  "authors": [
    "Enzo Marinari",
    "Remi Monasson",
    "Guilhem Semerjian"
  ],
  "comment": "7 pages, 3 figures, minor corrections, accepted version",
  "journal": "Europhys. Lett. 73, 8 (2006)",
  "doi": "10.1209/epl/i2005-10355-0",
  "categories": [
    "cond-mat.stat-mech",
    "cond-mat.dis-nn"
  ],
  "abstract": "We introduce an algorithm which estimates the number of circuits in a graph as a function of their length. This approach provides analytical results for the typical entropy of circuits in sparse random graphs. When applied to real-world networks, it allows to estimate exponentially large numbers of circuits in polynomial time. We illustrate the method by studying a graph of the Internet structure.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2006-01-03T11:23:04.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "counting circuits",
      "application",
      "estimate exponentially large numbers",
      "sparse random graphs",
      "internet structure"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}