{
  "id": "1503.08632",
  "version": "v1",
  "published": "2015-03-30T10:50:24.000Z",
  "updated": "2015-03-30T10:50:24.000Z",
  "title": "Entrance and sojourn times for Markov chains. Application to $(L,R)$-random walks",
  "authors": [
    "Valentina Cammarota",
    "Aimé Lachal"
  ],
  "comment": "30 pages",
  "categories": [
    "math.PR"
  ],
  "abstract": "In this paper, we provide a methodology for computing the probability distribution of sojourn times for a wide class of Markov chains. Our methodology consists in writing out linear systems and matrix equations for generating functions involving relations with entrance times. We apply the developed methodology to some classes of random walks with bounded integer-valued jumps.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-03-30T10:50:24.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60J10",
      "60J22"
    ],
    "keywords": [
      "markov chains",
      "sojourn times",
      "random walks",
      "application",
      "wide class"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 30,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150308632C"
    }
  }
}