Math 2.0

concept

Absorbing Markov chain

Summary

An absorbing Markov chain has at least one state that it never leaves. Also, each state can reach such a state. The node absorbing Markov chain gives the precise definition.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

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

Sources

  1. Web https://en.wikipedia.org/wiki/Absorbing_Markov_chain, lead section