(A) Stochastic matrices are organized as in each stochastic matrix is square, non-negative and organized such that the

*i*^{th} row of the matrix provides probabilities of transitions from state

*i* to all other states in the model and the sum of each row is equal to 1. The three matrices show the transition probabilities from states

*i* to state

*j* after one (

**P**^{1}), two (

**P**^{2}), and ten (

**P**^{10}), transition steps of the Markov process. The labels, “Start” and “End” correspond to the generating and absorbing states of the Markov chain, respectively. The rest of the labels indicate metastasis stages that were suggested by the authors (in blue) and by individual experts (in red). (B) The probability of finding the Markov process in a given state at transition

*n* (

*n* = 1, 2, …, 50) is given by

. Here

**Λ** is the distribution over all states at the beginning of the chain, and

**P**^{n} = [

*p*_{ij}^{(n)}] is the transition probability matrix after the

*n*^{th} transition (obtained by raising matrix

**P** to

*n*^{th} power). This figure demonstrates the decreasing probability that expert intuition about metastasis lands in any particular state at any particular stage. Note that even after 50 transitions there is a substantial probability that the chain would not reach the “End” state.

## PubMed Commons