Skip to content
START WITH A QUESTION

What would you like to understand?

Find an answer. See the moment it becomes clear. Follow the idea further.

← Concept directory

Answers for “如何从当前状态计算下一个状态向量?”

1 keyword matches

Understanding your question. You can explore the search results below now.

Meet the concept

↗

S1S_1 is the state vector after one iteration of the Markov chain. Its top entry is the probability of being in state A, and its bottom entry is the probability of being in state B after one step.

Conditions: Two-state chain with states A and B.; Entries are probabilities.; In the examples shown, the entries sum to 1.