{
  "annotation_id": "62ba2f18-2123-4a1d-8a71-e4584be1e768",
  "date_created": "2026-03-02T18:01:18.509000Z",
  "date_modified": "2026-03-02T18:01:18.509000Z",
  "file_hash": "3c875657b1b7927e647717c5ac354e511349d6c45269d85528da9ea1ef349aba",
  "private": false,
  "record": {
    "abstract": "We consider navigation or search schemes on networks which are realistic in\nthe sense that not all search chains can be completed. We show that the\nquantity $\\mu = \\rho/s_d$, where $s_d$ is the average dynamic shortest distance\nand $\\rho$ the success rate of completion of a search, is a consistent measure\nfor the quality of a search strategy. Taking the example of realistic searches\non scale-free networks, we find that $\\mu$ scales with the system size $N$ as\n$N^{-\\delta}$, where $\\delta $ decreases as the searching strategy is improved.\n  This measure is also shown to be sensitive to the distintinguishing\ncharacteristics of networks. In this new approach, a dynamic small world (DSW)\neffect is said to exist when $\\delta \\approx 0$. We show that such a DSW indeed\nexists in social networks in which the linking probability is dependent on\nsocial distances.",
    "arxiv_id": "physics/0702202",
    "authors": [
      "Parongama Sen"
    ],
    "categories": [
      "physics.soc-ph"
    ],
    "doi": "10.1088/1742-5468/2007/04/P04007",
    "title": "A novel approach to study realistic navigations on networks",
    "url": "https://arxiv.org/abs/physics/0702202"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "81eaf6ca-e48b-4b7f-9b58-bdf2c5dd0b4b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}