{
  "id": "1112.3797",
  "version": "v1",
  "published": "2011-12-16T13:02:03.000Z",
  "updated": "2011-12-16T13:02:03.000Z",
  "title": "The number of generations entirely visited for recurrent random walks on random environment",
  "authors": [
    "Pierre Andreoletti",
    "Pierre Debs"
  ],
  "categories": [
    "math.PR"
  ],
  "abstract": "In this paper we are interested in a random walk in a random environment on a super-critical Galton-Watson tree. We focus on the recurrent cases already studied by Y. Hu and Z. Shi and G. Faraud. We prove that the largest generation entirely visited by these walks behaves like log n and that the constant of normalization which differs from a case to another is function of the inverse of the constant of Biggins' law of large number for branching random walks.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-12-16T13:02:03.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "recurrent random walks",
      "random environment",
      "super-critical galton-watson tree",
      "walks behaves",
      "branching random walks"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1112.3797A"
    }
  }
}