{
  "id": "1501.01246",
  "version": "v1",
  "published": "2015-01-06T17:45:17.000Z",
  "updated": "2015-01-06T17:45:17.000Z",
  "title": "Reachability on scale-free networks",
  "authors": [
    "Yagnik Goswami",
    "M. S. Santhanam"
  ],
  "comment": "4 pages, 4 figures",
  "categories": [
    "cond-mat.stat-mech",
    "physics.soc-ph"
  ],
  "abstract": "Random walk on discrete lattices is a fundamental model in physics that forms the basis for our understanding of transport and diffusion process. In this work, we study unreachability in networks, {\\it i.e}, the number of nodes not visited by any walkers until some finite time. We show that for the case of multiple random walkers on scale-free networks, the fraction of sites not visited is well approximated by a stretched exponential function. We also discuss some preliminary results for distinct sites visited on time-varying networks.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-01-06T17:45:17.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "scale-free networks",
      "multiple random walkers",
      "discrete lattices",
      "fundamental model",
      "diffusion process"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}