线性代数 · free preview

Stochastic Matrices

Stochastic Matrices

1. Introduction

Introduction

2. Difference Equations

Difference Equations

3. Stochastic Matrices and the Steady State

Stochastic Matrices and the Steady State

4. Google’s PageRank Algorithm

Google’s PageRank Algorithm

5. Spot the stochastic matrix

Which of the following matrices is stochastic?

6. Why 1 is an eigenvalue

Let AA be a stochastic matrix (columns sum to 11). Which statement is true?

7. Vocabulary: stochastic matrix

In one word: a matrix with nonnegative entries whose columns sum to 11 is called a ______ matrix.

8. One step of the chain

Start with u1=(0.80.2)u_1 = \begin{pmatrix}0.8\\0.2\end{pmatrix} and multiply by the stochastic matrix A=(0.80.30.20.7)A = \begin{pmatrix} 0.8 & 0.3 \\ 0.2 & 0.7 \end{pmatrix}. Enter u2=Au1u_2 = Au_1 as two decimals separated by a comma (for example: 0.5,0.5).

9. Steady state of a Markov matrix

Let

A=(0.40.20.30.20.40.30.40.40.4).A = \begin{pmatrix} 0.4 & 0.2 & 0.3 \\ 0.2 & 0.4 & 0.3 \\ 0.4 & 0.4 & 0.4 \end{pmatrix}.

The columns sum to 11, and AA has eigenvalues 00, 15\tfrac{1}{5} and 11. The eigenvector of AA for λ=1\lambda = 1 is proportional to (3,3,4)(3,3,4). Starting from u0=(1,0,0)u_0 = (1,0,0), the iterates Aku0A^k u_0 converge to the steady state. Enter it as three decimals separated by commas (for example: 0.5,0.5,0.5).

10. In your own words

In your own words, state the single most important definition or theorem of this section, and explain what it says.

Practice this interactively

Free account · instant grading · spaced review that schedules itself.

Start this course — free