{
  "id": "1207.6994",
  "version": "v1",
  "published": "2012-07-30T16:58:43.000Z",
  "updated": "2012-07-30T16:58:43.000Z",
  "title": "Random Walks between Leaves of Random Networks",
  "authors": [
    "David Lancaster"
  ],
  "comment": "12 pages, 6 figures",
  "categories": [
    "cond-mat.dis-nn",
    "cs.CY"
  ],
  "abstract": "We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs and Barabasi-Albert scale free networks, these walks are not transient and we consider various approaches to computing the probability of a given length walk.One approach is to label nodes according to both their total degree and the number of links connected to leaf nodes, and as a byproduct we compute the probability of a random node of a scale free network having such a label.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-07-30T16:58:43.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "random networks",
      "random walks",
      "barabasi-albert scale free networks",
      "erdos-renyi random graphs",
      "probability"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1207.6994L"
    }
  }
}