Math 2.0

Probability theory and stochastic processes Markov processes Concept

Recurrence and transience of states

Summary

A state of a Markov chain is recurrent if the chain, started there, returns to it with probability one, and transient otherwise. A recurrent state is visited infinitely often, while a transient state is visited only finitely often, almost surely. Recurrent states are further split into positive recurrent and null recurrent, according to whether the mean return time is finite. In an irreducible chain all states have the same type, which decides whether a stationary distribution exists.

Where this leads

4 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Discrete-time_Markov_chain
About this page
TagPBZTBWZ4GS
URIm2://PBZTBWZ4GS
Kindconcept
WritingW0 stub
MSC60J10
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by

Results about this

Definitions