{
  "annotation_id": "51a1de2d-e6f7-4d79-bbaf-ecbb48a4edc9",
  "date_created": "2026-03-02T18:01:14.922000Z",
  "date_modified": "2026-03-02T18:01:14.922000Z",
  "file_hash": "2c454fc76ca2f248e1818cd40095172265103b5d6e43f040b2092e1430b6b5e6",
  "private": false,
  "record": {
    "abstract": "We study localization of information on scale free networks with\ncommunication constraints when, for some reason, information can propagate only\nbetween ``mutually trusted nodes\u0027\u0027 (MTN). We propose an algorithm to construct\nthe MTN network and show that there is a critical value of trusted nodes below\nwhich information localizes. This critical value increases drastically if a\nfraction p of nodes does not transfer information at all. We study the fraction\nof initial messangers needed to inform a desired fraction of the network as a\nfunction of the average number of trusted nodes and discuss possible\napplications of the model to marketing, to the spreading of risky information\nand to the spreading of a disease with very short incubation time.",
    "arxiv_id": "physics/0611008",
    "authors": [
      "Kosmas Kosmidis",
      "Armin Bunde"
    ],
    "categories": [
      "physics.soc-ph"
    ],
    "title": "Spreading and localization of information in scale-free networks with   communication constraints",
    "url": "https://arxiv.org/abs/physics/0611008"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "25cc35c0-ae05-44de-b815-6004dae93c3a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}