Re: Unsolved statistic questions from other sites, part II
chisigma said:
Posted the 08 20 2008 [!] on http://www.scienzematematiche.it [original in Italian...] and [incredibly (Wasntme)...] not yet solved...
At the time t=0 the vertex of a triangle are sized be three fleas. At the times t=1,2,... each flea jumps from a vetex to one other vertex of the triangle. What is the mean number of jumps after whom the three fleas come together?...
Calling A,B and C the vertex of the triangle, the possible transictions are represented in the figure...
http://d16cgiik7nzsna.cloudfront.net/f3/32/i69153523._szw380h285_.jpg
We suppose for semplicity that each transition has probability ${1}{2}$. The problem can be structured as a Markov Chain represented by the following graph... The state 1 represents the three fleas on three different vertex, the state 2 represents two fleas on one vertex and one flea on one of the other vertex, the state 3 represents all the fleas on the same vertex. The next step is the computation of the transitions probabilities. If we are in state 1 the possible transitions are...
http://www.123homepage.it/u/i69185898._szw380h285_.jpg.jfif
A -> B A -> C A -> B A -> B A -> B A -> C A -> C A -> C
B -> C B -> A B -> A B -> C B -> A B -> C B -> A B -> C
C -> A C -> B C -> B c -> B C -> A C -> A C -> A C -> B (1)
... and from (1) we can easily verify that is $\displaystyle p_{1,1}= \frac{1}{4}$ and $\displaystyle p_{1,2}= \frac{3}{4}$. If we are in the state 2 with fleas in A,A and B the possible transitions are...
A -> B A -> B A -> B A -> B A -> C A -> C A -> C A -> C
A -> B A -> C A -> B A -> C A -> C A -> B A -> C A -> B
B -> A B -> A B -> C B -> C B -> C B -> A B -> A B -> C (2)
... and from (2) we can easily verify that is $\displaystyle p_{2,3}= \frac{1}{8}$, $\displaystyle p_{2,2}=\frac{5}{8}$ and $\displaystyle p_{2,1}=\frac{1}{4}$. Now we are able to write the transition matrix of the Markov Chain...
$\displaystyle P = \left | \begin{matrix} \frac{1}{4} & \frac{3}{4} & 0 \\ \frac{1}{4} & \frac{5}{8} & \frac{1}{8} \\ 0 & 0 & 1 \end{matrix} \right| $ (3)
... and proceed as in...
http://www.mathhelpboards.com/f23/expected-number-questions-win-game-4154/
Clearly the only adsorbing state is the state 3 so that we can write matrix Q...
$\displaystyle Q = \left | \begin{matrix} \frac{1}{4} & \frac{3}{4} \\ \frac{1}{4} & \frac{5}{8} \end{matrix} \right| $ (4)
... and then the fundamental matrix N...
$\displaystyle N = (I_{2} - Q)^{-1} = \left | \begin{matrix} 4 & 8 \\ \frac{8}{3} & 8 \end{matrix} \right| $ (5)
The (5) permits to conlude that, starting from state 1 the expected number of jumps is $T= 4 + 8 = 12$ and starting from the state 2 the expected number of jumps is $ T = \frac{8}{3} + 8 = \frac{32}{3}$ ... Kind regards $\chi$ $\sigma$