The Dance of the Random Walker
A Journey Through Probability
Imagine standing on a long, straight path. You are about to embark on a journey of exactly 11 steps.
With every move, you flip a mental coin—but it is a biased coin. You are more likely to step backward (60% chance) than forward (40% chance).
This is the classic 'Random Walk' problem, a fundamental pillar of statistical physics and probability theory. Today, we are going to break down this journey not just as a math problem, but as a story of paths taken and paths left behind.
Defining the Terrain
We start with n=11 total steps. Our goal is simple: at the end of these 11 steps, we want to be exactly 1 unit away from where we started.
Let f be the number of forward steps and b be the number of backward steps. We know two things immediately: first, the total number of steps is f+b=11.
Second, our net displacement is f−b. To be one step away, this displacement must satisfy the condition ∣f−b∣=1. This gives us two distinct realities: either we end at +1 or we end at −1.
Solving the Two Realities
Let us look at the first reality: f−b=1. By solving the system of equations f+b=11 and f−b=1, we add them to get 2f=12.
This tells us we must take exactly f=6 forward steps and b=5 backward steps.
Now, consider the second reality: f−b=−1. Solving f+b=11 and f−b=−1 gives us 2f=10, meaning we need f=5 forward steps and b=6 backward steps.
These are the only two ways to satisfy the condition. Any other combination of steps would land us at a displacement of 3,5,7,9, or 11, but never 1.
The Power of the Binomial Distribution
Now, we bring in the heavy artillery: the Binomial Distribution. The probability of taking k forward steps in n trials is given by:
Here, p=0.4 and q=0.6.
For our first case (f=6), the probability is:
P(X=6)=(611)(0.4)6(0.6)5
For our second case (f=5), the probability is:
P(X=5)=(511)(0.4)5(0.6)6
We are summing these two probabilities:
Ptotal=(611)(0.4)6(0.6)5+(511)(0.4)5(0.6)6
The Elegance of Symmetry
Here is where the magic happens. Recall that (611) is identical to (511), which is 462.
We can factor out the common terms:
(511)(0.4)5(0.6)5[0.4+0.6]
Since 0.4+0.6=1, the entire expression collapses into a much simpler form:
Calculating this, we arrive at approximately 0.37.
The Takeaway
What have we learned? We learned that in a random walk, the parity of the steps matters.
If you take an odd number of steps, you can never return to the origin (displacement 0), because n and d must have the same parity.
This problem is a beautiful reminder that even in the chaos of random movement, there is a rigid, underlying structure governed by the laws of combinatorics. Keep practicing, keep visualizing, and remember: every complex problem is just a collection of simple, logical steps waiting to be connected.