Ants on a cube

There exists a cube in space. Two ants start at two random and distinct corners of the cube and move only along the edges of the cube. If either ant is at a corner, it chooses an edge randomly and moves to an adjacent corner with uniform velocity. The ants make their decisions independently. They start moving simultaneously when the clock is at zero, and move continuously with constant speed. If it is known that an ant traverses a side of the cube in one second, find the expected time elapsed(in seconds) before they meet for the first time. Round your answer off to the nearest integer.

Liked this? Try similar problems in the set: Ants on an adventure!

Inspiration


The answer is 9.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Nicola Mignoni
Sep 23, 2018

The problem can be solved using a Markov Chain . We assume that both ants can meet either on an edge or on a vertex. Let's consider a cube which vertices are numbered from 1 1 to 8 8 . Let be S = { E , C , O , 0 } S=\{\text{E}, \, \text{C}, \, \text{O}, \, \text{0} \} the set of all possible states the ants can be in.

  • E \text{E} is the state in which at the next step the two ants could meet on an edge.
  • C \text{C} is the state in which at the next step the two ants could meet on a corner.
  • O \text{O} is the state in which the two ant are on opposite vertices.
  • 0 0 is the state in which the ants are on the same edge/corner.

Let's indicate with s |s| , s S s \in S , the number of couples of each state indicating where the ants are at. For example, 0 = { ( 1 , 1 ) , ( 2 , 2 ) , . . . , ( 8 , 8 ) } 0=\{(1,1), \, (2,2), \, ... \,, (8,8) \} , so 0 = 8 |0|=8 . You can figure out from the picture that E = 24 |E|=24 , C = 24 |C|=24 , O = 8 |O|=8 . Now, we can write the transition matrix P \textbf{P}

\displaystyle \textbf{P}= \begin{array}{[cccc]c} \\ E & C & O & 0 \\ \frac{6}{9} & 0 & \frac{2}{9} & \frac{1}{9} & E \\ 0 & \frac{7}{9} & 0 & \frac{2}{9} & C \\ \frac{6}{9} & 0 & \frac{3}{9} & 0 & O \\ 0 & 0 & 0 & 1 & 0 \end{array}

Following the standard theory of Markov chains, we evaluate N = ( I Q ) 1 \textbf{N}=(\textbf{I}-\textbf{Q})^{-1}

N = ( I Q ) 1 = ( 9 0 3 0 9 2 0 9 0 9 2 ) \displaystyle \textbf{N}=(\textbf{I}-\textbf{Q})^{-1} = \left( \begin{array}{c}\\ 9 & 0 & 3 \\ 0 & \frac{9}{2} & 0 \\ 9 & 0 & \frac{9}{2} \end{array} \right)

We define U = u i \text{U}=u_i , for 1 i 4 1 \leq i \leq 4 ,as the stochastic vector indicating the probabilities of each state being the starting state. We have

u 1 = P ( E ) = E 8 2 8 = 24 56 u 2 = P ( C ) = C 8 2 8 = 24 56 u 3 = P ( O ) = O 8 2 8 = 8 56 u 4 = P ( 0 ) = 0 \displaystyle u_1=\mathbb{P}(E)=\frac{|E|}{8^2-8}=\frac{24}{56} \\ \displaystyle u_2=\mathbb{P}(C)=\frac{|C|}{8^2-8}=\frac{24}{56} \\ \displaystyle u_3=\mathbb{P}(O)=\frac{|O|}{8^2-8}=\frac{8}{56} \\ \displaystyle u_4=\mathbb{P}(0)=0

Eventually, the expected value of arriving at the absorbing state is

E [ 0 ] = i = 1 3 i = 1 3 n i j u i = 24 56 12 + 9 2 24 56 + 27 2 8 56 = 9 \displaystyle E[0]=\sum_{i=1}^3 \sum_{i=1}^3 n_{ij}u_i=\frac{24}{56} \cdot 12+\frac{9}{2} \cdot \frac{24}{56} + \frac{27}{2} \cdot \frac{8}{56} = \boxed{9}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...