A scalar is an eigenvalue of an matrix if there is a nonzero vector such that
Any such vector is an eigenvector corresponding to . The requirement that an eigenvector be nonzero is essential: the zero vector would satisfy the equation for every scalar and would convey no information.
Use the state order Tall, Medium, Short and column probability distributions, so that . The th column records the child's probability distribution given parent state . Thus the transition matrix is
Every entry is nonnegative and every column sums to one. This convention also gives the requested property . A row-distribution convention would use the transposed transition matrix consistently instead. The stated Markov chain is the mathematical model to analyze; no additional biological assumptions are needed.
Condition on the intermediate parent's height and use the Markov property. The three mutually exclusive paths through Tall, Medium and Short contribute
Equivalently, this is entry of the matrix power . Hence
For , the entries of are the column sums of . Hence
so is an eigenvalue of , with eigenvector .
The determinant is unchanged by matrix transposition, so
Thus has a nontrivial null space, giving
The same argument with shows that a matrix and its transpose have the same characteristic polynomial. It does not say that they have the same eigenvectors: here .
Find a stationary distribution from and . The first two independent linear equations are
They give and . Normalization gives , hence
To justify the limit using the assumptions, distinct eigenvalues give an eigenbasis, over the complex numbers if necessary. Choose as the eigenvector for 1 and let correspond to the other eigenvalues . Expand the initial probability distribution as
Since , each satisfies
Multiplying the expansion by therefore gives . It follows that
because . The components of the limiting probability distribution are approximately .

Articles by others on the same topic (0)

There are currently no matching articles.