A particle starts at ( 0 , 0 ) in a coordinate plane. Every turn it has an equal chance of moving to the next adjacent integer point diagonally ( ( 1 , 1 ) ( 1 , − 1 ) ( − 1 , 1 ) ( − 1 , − 1 ) on the first turn).
What is the probability (in percentage) of the particle ever returning to the origin?
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.
@ Mark Hennings , we really liked your comment, and have converted it into a solution.
Why is P [ X ≥ k ] = ρ k ? Why not P [ X = k ] = ρ k ?
Log in to reply
ρ k just states that the origin is reached k times, but would allow for more returns as well. The probability of exactly k returns would be ρ k ( 1 − ρ ) , so that there were k returns, then no more.
Log in to reply
What is the justification for E [ X ] = ∑ k = 1 ∞ ρ k ?
Log in to reply
@Atomsky Jahid – It is a standard result that E [ X ] = k ≥ 1 ∑ P [ X ≥ k ]
Can you explain why the simple random walk is transient for n>2 ?
Problem Loading...
Note Loading...
Set Loading...
This is just the two-dimensional simple random walk, viewed at a 4 5 ∘ angle. It is a well-known result that the n -dimensional simple random walk is recurrent for n = 1 , 2 , and transient for n ≥ 3 . Thus this random walk is recurrent, which makes the probability of eventual return to the origin equal to 1 = 1 0 0 % .
Here is a detailed proof in this case.
Let X n be the random variable that is equal to 1 if the particle has returned to the origin after n steps, and 0 otherwise (note that X n = 0 if n is odd. If p n the the probability of returning to the origin after n steps, then p n = E [ X n ] . If X is the random variable equal to the total number of returns to the origin, then X = ∑ n = 1 ∞ X n , and hence E [ X ] = n = 1 ∑ ∞ E [ X n ] = n = 1 ∑ ∞ p n Suppose that ρ is the probability of ever returning to the origin. Then P [ X ≥ k ] = ρ k for all k ≥ 1 , and hence we deduce that E [ X ] = k = 1 ∑ ∞ P [ X ≥ k ] = { 1 − ρ ρ ∞ ρ < 1 ρ = 1 At each step of this random walk, the particle moves either left or right one step, and at the same times moves either up or down one step. Moves of left and right are equally likely, as are moves of up and down. Moreover, the left and right moves are independent of the up and down moves. Thus, in order to return to the origin after 2 n moves, there have to be n left and n right moves, and n up and n down moves. Thus p 2 n = ( 2 2 n 1 ( n 2 n ) ) 2 n ≥ 1 Stirling's approximation tells us that p 2 n ∼ π n 1 n → ∞ and hence that E [ X ] = n = 1 ∑ ∞ p n = ∞ which implies that ρ = 1 = 1 0 0 % .