{
  "annotation_id": "dbc52376-a430-43d1-b7b6-9fd71d0d4969",
  "date_created": "2026-03-02T18:01:31.544000Z",
  "date_modified": "2026-03-02T18:01:31.544000Z",
  "file_hash": "8ccadfc33166072a55c83d16e02d18f52ce8e4f2319f08cd0702bd3235bd1c08",
  "private": false,
  "record": {
    "abstract": "A population of complete subgraphs or cliques in a network evolving via\nduplication-divergence is considered. We find that a number of cliques of each\nsize scales linearly with the size of the network. We also derive a clique\npopulation distribution that is in perfect agreement with both the simulation\nresults and the clique statistic of the protein-protein binding network of the\nfruit fly. In addition, we show that such features as fat-tail degree\ndistribution, various rates of average degree growth and non-averaging,\nrevealed recently for only the particular case of a completely asymmetric\ndivergence, are present in a general case of arbitrary divergence.",
    "arxiv_id": "q-bio/0502005",
    "authors": [
      "I. Ispolatov",
      "P. L. Krapivsky",
      "I. Mazo",
      "A. Yuryev"
    ],
    "categories": [
      "q-bio.MN",
      "cond-mat.dis-nn",
      "q-bio.GN"
    ],
    "doi": "10.1088/1367-2630/7/1/145",
    "journal_ref": "New J. Phys. v. 7 (2005) 145",
    "title": "Cliques and duplication-divergence network growth",
    "url": "https://arxiv.org/abs/q-bio/0502005"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "70a7ecda-b320-43ba-bf33-23962617b3d2",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}