Lecture -7
Random Walk Stochastic Process
1. Discrete time Random Walk when 𝛜𝐭 follows a coin toss or Bernoulli distribution.
Case-1
Case-2
Example-1
Solution
R-Code
# Define the time steps
t <- 0:5
# Define the corresponding random walk positions
X_t <- c(0, 1, 0, 1, 2, 1)
# Plot the random walk path
plot(t, X_t, type = "o", pch = 16, col = "blue", lwd = 2, ylim = c(min(X_t) - 1, max(X_t) + 1),
xlab = "Time Step (t)", ylab = "Position (X_t)", main = "Random Walk Path")
# Add grid for better readability
grid()
# Annotate points
text(t, X_t, labels = X_t, pos = 3, cex = 1.2, col = "red")
Note. The following figure shows ensemble of the realization of the discrete time Random Walk
Process
Properties
1. Expected Value
2. Variance
3. No mean Reversion
4. Martingale Property
5. Uncorrelated Increments
A Simple Random Walk Model
a. Definition and Probability Representation
b. Net Displacement or Profit
c. Understanding Key Parameters
Example-1
Example-2
Compute the probability of landing at origin using the simple random walk model.
Solution
Exercises
Q.1
Derive the probability distribution of landing on (I) even number of steps (ii) off number of
steps.
Q.2
Q.3
Q.4
Q.5
Find the probability that a symmetric random walk returns to the origin for the first time after exactly 4
steps. Write the sequences of path that are not valid in the given scenario.