<?xml version="1.0" encoding="UTF-8" ?>
  <resource>
  <id>6565</id>
  <path>/www/nrich/html/content/id/6565/</path>
  <resourceTypeID>1</resourceTypeID>
  <last_published>0000-00-00T00:00:00</last_published>
  <indexXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;
You will need to know how to multiply matrices to tackle the later stages of this problem. &lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
The diagram below shows three nodes, numbered $1,2,$ and $3$. If I am at node $1$, I am equally likely to visit node $2$ or $3$ next. If I am at node $3$ I am equally likely to visit node $1$ or $2$ next. If I am at node $2$ I will remain there. These probabilities are shown on the diagram by the arrows linking the nodes.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;div style=&quot;text-align: center;&quot;&gt;&lt;mdo:image alt=&quot;Diagram showing probability of travelling between nodes&quot; height=&quot;249&quot; src=&quot;prob%20matrix.png&quot; width=&quot;240&quot;&gt;&lt;/mdo:image&gt;&lt;/div&gt;
I can also represent this diagram using a matrix:&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;div&gt;$$A= \left( \begin{array}{ccc} 0 &amp;amp;0.5 &amp;amp;0.5 \\ 0 &amp;amp;1 &amp;amp;0 \\ 0.5 &amp;amp;0.5 &amp;amp;0 \end{array}\right)$$&lt;/div&gt;
&lt;br&gt;&lt;/br&gt;
&lt;div&gt;Each entry in this matrix $a_{ij}$ gives the probability of travelling from vertex $i$ to vertex $j$. So for example the entry in row $1$ column $2$ gives the probability of travelling from vertex $1$ to vertex $2$.&lt;/div&gt;
&lt;br&gt;&lt;/br&gt;
&lt;div&gt;What can you say about the total of the entries in each row of a matrix such as this one?&lt;/div&gt;
&lt;br&gt;&lt;/br&gt;
The probability of being at vertex $2$ after two moves if I started from vertex $1$ is $0.75$. Work out the other entries for the matrix representing the probability of moving from vertex to vertex in two moves.&lt;br&gt;&lt;/br&gt;
How is this matrix related to the original matrix?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$$A^2=\left(\begin{array}{ccc} 0.25 &amp;amp;0.75 &amp;amp;0 \\ 0 &amp;amp;1 &amp;amp;0 \\ 0 &amp;amp;0.75 &amp;amp;0.25 \end{array} \right)$$&lt;br&gt;&lt;/br&gt;
$$A^3=\left(\begin{array}{ccc} 0 &amp;amp;0.875 &amp;amp;0.125 \\ 0 &amp;amp;1 &amp;amp;0 \\ 0.125 &amp;amp;0.875 &amp;amp;0 \end{array} \right)$$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Can you explain the zero entries in these two matrices?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Make a suggestion of the form the matrix takes showing the probabilities after $n$ moves. You may wish to consider $n$ odd and even separately. Can you prove that the form you have suggested is correct?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
What happens as $n$ gets very large? How can this be explained by the diagram?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</indexXML>
  <solutionXML/>
  <noteXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</noteXML>
  <clueXML/>
  <canonXML/>
  <end_user_role>2</end_user_role>
  <difficulty>3</difficulty>
  <keystage1>0</keystage1>
  <keystage2>0</keystage2>
  <keystage3>0</keystage3>
  <keystage4>0</keystage4>
  <keystage4plus>1</keystage4plus>
  <title>Probability Matrix</title>
  <description></description>
</resource>