{
  "id": "1103.5536",
  "version": "v1",
  "published": "2011-03-29T03:04:55.000Z",
  "updated": "2011-03-29T03:04:55.000Z",
  "title": "Localization of reinforced random walks",
  "authors": [
    "Pierre Tarrès"
  ],
  "comment": "5 figures",
  "categories": [
    "math.PR"
  ],
  "abstract": "We describe and analyze how reinforced random walks can eventually localize, i.e. only visit finitely many sites. After introducing vertex and edge self-interacting walks on a discrete graph in a general setting, and stating the main results and conjectures so far on the topic, we present martingale techniques that provide an alternative proof of the a.s. localization of vertex-reinforced random walks (VRRWs) on the integers on finitely many sites and, with positive probability, on five consecutive sites, initially proved by Pemantle and Volkov (1999). Next we introduce the continuous time-lines representation (sometimes called Rubin construction) and its martingale counterpart, and explain how it has been used to prove localization of some reinforced walks on one attracting edge. Then we show how a modified version of this construction enables one to propose a new short proof of the a.s. localization of VRRWs on five sites on Z.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-03-29T03:04:55.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "localization",
      "martingale counterpart",
      "short proof",
      "rubin construction",
      "edge self-interacting walks"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1103.5536T"
    }
  }
}