{
  "annotation_id": "97e06215-88cc-430b-9b96-c55ec1d72cf1",
  "date_created": "2026-03-02T18:01:04.403000Z",
  "date_modified": "2026-03-02T18:01:04.403000Z",
  "file_hash": "fe5bab0597bdcc89a06183994e49172f25d0dbfcbf1962889869048231381027",
  "private": false,
  "record": {
    "abstract": "We consider the average probability X of being informed on a gossip in a\ngiven social network. The network is modeled within the random graph theory of\nErdos and Renyi. In this theory, a network is characterized by two parameters:\nthe size N and the link probability p. Our experimental data suggest three\nlevels of social inclusion of friendship. The critical value p_c, for which\nhalf of agents are informed, scales with the system size as N^{-\\gamma} with\n\\gamma\\approx 0.68. Computer simulations show that the probability X varies\nwith p as a sigmoidal curve. Influence of the correlations between neighbors is\nalso evaluated: with increasing clustering coefficient C, X decreases.",
    "arxiv_id": "physics/0601158",
    "authors": [
      "K. Malarz",
      "Z. Szvetelszky",
      "B. Szekfu",
      "K. Kulakowski"
    ],
    "categories": [
      "physics.soc-ph"
    ],
    "journal_ref": "Acta Phys. Pol. B37 (2006) 3049",
    "title": "Gossip in random networks",
    "url": "https://arxiv.org/abs/physics/0601158"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "69d7069a-f866-4a12-a9ec-f61d9219088a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}