{
  "id": "1412.5330",
  "version": "v1",
  "published": "2014-12-17T10:54:04.000Z",
  "updated": "2014-12-17T10:54:04.000Z",
  "title": "Rotor-routing on Galton-Watson trees",
  "authors": [
    "Wilfried Huss",
    "Sebastian Mueller",
    "Ecaterina Sava-Huss"
  ],
  "comment": "12 pages",
  "categories": [
    "math.PR"
  ],
  "abstract": "A rotor-router walk on a graph is a deterministic process, in which each vertex is endowed with a rotor that points to one of the neighbors. A particle located at some vertex first rotates the rotor in a prescribed order, and then it is routed to the neighbor the rotor is now pointing at. In the current work we make a step toward in understanding the behavior of rotor-router walks on random trees. More precisely, we consider random i.i.d. initial configurations of rotors on Galton-Watson trees, and and give a classification in recurrence and transience for transfinite rotor-router walks on these trees.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-12-17T10:54:04.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60J80",
      "05C81",
      "05C05"
    ],
    "keywords": [
      "galton-watson trees",
      "transfinite rotor-router walks",
      "vertex first rotates",
      "deterministic process",
      "random trees"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1412.5330H"
    }
  }
}