{
  "annotation_id": "055fc243-1c75-4f69-ad78-ff33966c4ef0",
  "date_created": "2026-03-02T18:01:17.763000Z",
  "date_modified": "2026-03-02T18:01:17.763000Z",
  "file_hash": "857f18e34658ca9e7a9848d9579211077b2dbd8175bb2c89d2ca611afd0bad5b",
  "private": false,
  "record": {
    "abstract": "We show how effectively the diffusive capture processes (DCP) on complex\nnetworks can be applied to information search in the networks. Numerical\nsimulations show that our method generates only 2% of traffic compared with the\nmost popular flooding-based query-packet-forwarding (FB) algorithm. We find\nthat the average searching time, $\u003cT\u003e$, of the our model is more scalable than\nanother well known $n$-random walker model and comparable to the FB algorithm\nboth on real Gnutella network and scale-free networks with $\\gamma =2.4$. We\nalso discuss the possible relationship between $\u003cT\u003e$ and $\u003ck^2\u003e$, the second\nmoment of the degree distribution of the networks.",
    "arxiv_id": "physics/0703040",
    "authors": [
      "Sungmin Lee",
      "Soon-Hyung Yook",
      "Yup Kim"
    ],
    "categories": [
      "physics.soc-ph",
      "physics.gen-ph"
    ],
    "doi": "10.1016/j.physa.2007.07.022",
    "title": "Diffusive capture processes for information search",
    "url": "https://arxiv.org/abs/physics/0703040"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c6bd9eb4-6a6a-4577-9f2a-9b90d8dcaa12",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}