{
  "id": "1808.04261",
  "version": "v1",
  "published": "2018-08-13T14:23:28.000Z",
  "updated": "2018-08-13T14:23:28.000Z",
  "title": "On the Distribution of Range for Tree-Indexed Random Walks",
  "authors": [
    "Aaron Berger",
    "Caleb Ji",
    "Erik Metz"
  ],
  "comment": "6 Pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We study tree-indexed random walks for spiders, trees with one vertex of degree greater than two. Our main result confirms a conjecture of Benjamini, H\\\"aggstr\\\"om, and Mossel for such graphs, namely that the distribution of the range for any such tree is dominated by that of a path on the same number of edges.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-08-13T14:23:28.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C78",
      "05A16",
      "05C81",
      "82B41"
    ],
    "keywords": [
      "distribution",
      "study tree-indexed random walks",
      "main result confirms",
      "degree greater",
      "conjecture"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}