Markov Chains, Markov Process, Python, Discrete Time Markov, Probability.
property (Image by Author) n-step transition probabilities The state transition matrix P has this nice property by which if you multiply it with itself k times, then the matrix P^k contains the probabilities of all transitions that are k-steps long, i.e. the probability that system will be in state