A particles moves in $\mathbb{R^2}$ started at the origin. At each stage $i (i = 1, 2, ...)$, the particles would move, independently of all the stages before, one of the four directions North, East, South and West 1 unit, with probability $1 \over 4 $ each.Let $T_n$ be the distance from the origin just after $n$ steps. What is $E(T_n)$. I tried define 4 $1\times 2$matrice with only $1,0,-1$ in all entries. The use technique similar to simple random walk in 1 dimension and we know that for a $1\times 2$ matrice $(x,y)$, the distance from origin =$\sqrt {x^2+y^2}$ but i am not sure how to like the 1 D to 2 D. As in 2 D there are 4 possible direction.
$\begingroup$
$\endgroup$
1
-
$\begingroup$ According to this, it takes $({d\over l})^2$ steps on average to travel a distance $d$ with step length $l$. $\endgroup$– BenCommented Nov 1, 2012 at 11:50
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
3
An explanation is given here.
Using that formula you get for the 2D case for the distance from the origin just after n steps:
$$\sqrt{2n} \dfrac{\Gamma(\frac{3}{2})}{\Gamma(\frac{1}{2})}=\sqrt{\frac{n}{2}}$$
-
3$\begingroup$ Careful with that axe, Eugene: This is not an exact formula but an asymptotics when $n\to\infty$. Except in 1D, there is no known formula, valid for every $n$, other than the cumbersome summations one can fathom. $\endgroup$– DidCommented Nov 2, 2012 at 7:56
-
$\begingroup$ I guess this formula holds only if we consider a very large $n$ where $n\rightarrow\infty$ but what about for a small $n$ $\endgroup$ Commented Nov 2, 2012 at 8:13
-
2$\begingroup$ Mathematics: Did you read my comment above? $\endgroup$– DidCommented Nov 2, 2012 at 12:35