{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "B1E1ES1BYD"
    },
    {
      "field": "uses",
      "target": "BEQH6AZPYM"
    },
    {
      "field": "about",
      "target": "BEQH6AZPYM"
    },
    {
      "field": "defines",
      "target": "FHC702B2R7"
    }
  ],
  "body": "\n## Summary\n\nA state of a [[Markov chain|0G48PYM96Q]] is recurrent if the chain, started there, returns to it with probability one, and transient otherwise.\nA recurrent state is visited infinitely often, while a transient state is visited only finitely often, almost surely.\nRecurrent states are further split into positive recurrent and null recurrent, according to whether the mean return time is finite.\nIn an irreducible chain all states have the same type, which decides whether a [[stationary distribution|0KRH5157WP]] exists.\n\n## Explanations\n\n### L1 human\n\nImagine a walker moving at random between rooms and ask whether she surely comes back to the room where she started.\nIf yes, the room is recurrent, and she will in fact come back again and again forever.\nIf there is a positive chance that she never returns, the room is transient, and after some last visit she leaves for good.\nThe fair coin walk on the integers comes back to $0$ for sure, while a walk that steps right with probability $2/3$ drifts away and may never return.\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "kind": "concept",
    "msc": [
      "60J10"
    ],
    "name": "Recurrence and transience of states",
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Discrete-time_Markov_chain"
      }
    ],
    "tag": "PBZTBWZ4GS"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/PBZTBWZ4GS/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/PBZTBWZ4GS.md",
  "msc": [
    "60J10"
  ],
  "name": "Recurrence and transience of states",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/PBZ/PBZTBWZ4GS.md",
  "status": null,
  "tag": "PBZTBWZ4GS",
  "uri": "m2://PBZTBWZ4GS",
  "url": "https://math2.tamnd.com/wiki/recurrence-and-transience-of-states/",
  "writing": {
    "tag": "PBZTBWZ4GS",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      },
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}