Grinstead-Snell-Probability · Problem 11.1.15

Markov Chains

Mathematics · markov-chains-introduction

Problem

Write a program to simulate the outcomes of a Markov chain after nn steps, given the initial starting state and the transition matrix P\mathbf{P} as data (see Example 11.12). Keep this program for use in later problems.

Related theory

Browse the problem library