{
  "annotation_id": "a5b8b095-8bb5-4c65-affb-4db54e84522a",
  "date_created": "2026-03-02T18:01:10.744000Z",
  "date_modified": "2026-03-02T18:01:10.744000Z",
  "file_hash": "5d619118e7d776f4ef0c1088f3b18a17cb4af3205e012a34ed25ec16af91e0e3",
  "private": false,
  "record": {
    "abstract": "We consider distributed networks, such as peer-to-peer networks, whose\nstructure can be manipulated by adjusting the rules by which vertices enter and\nleave the network. We focus in particular on degree distributions and show\nthat, with some mild constraints, it is possible by a suitable choice of rules\nto arrange for the network to have any degree distribution we desire. We also\ndescribe a mechanism based on biased random walks by which appropriate rules\ncould be implemented in practice. As an example application, we describe and\nsimulate the construction of a peer-to-peer network optimized to minimize\nsearch times and bandwidth requirements.",
    "arxiv_id": "physics/0608057",
    "authors": [
      "Gourab Ghoshal",
      "M. E. J. Newman"
    ],
    "categories": [
      "physics.soc-ph"
    ],
    "doi": "10.1140/epjb/e2007-00208-2",
    "journal_ref": "Eur. Phys. J. B 59, 75-83 (2007)",
    "title": "Growing distributed networks with arbitrary degree distributions",
    "url": "https://arxiv.org/abs/physics/0608057"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "40151809-4f86-4c9f-8fac-a36c434a8173",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}