Given the scarcity, here is a strategy to build your own verified solution manual:
Focus: Definition, Inter-arrival times, Conditional Distribution of arrival times.
Key Concepts:
Most students ignore this chapter. Do not. The problems here involve Borel-Cantelli lemmas and advanced expectation tricks that reappear in Chapter 8 (Brownian motion). A good solution set for Chapter 1 should show you how to handle "indicator variable" splitting—Ross’s favorite technique. --- Sheldon M Ross Stochastic Process 2nd Edition Solution
Focus: Discrete-time chains, Transition matrices, Classification of states, Limiting probabilities.
This is the largest and most critical chapter in the book.
Problem Type: Find the Stationary Distribution $\pi$. Solution Algorithm: Given the scarcity, here is a strategy to
Problem Type: Mean Time Spent in Transient States. Solution Strategy: Use the fundamental matrix $\mathbfM = (\mathbfI - \mathbfQ)^-1$, where $\mathbfQ$ is the submatrix of the transition matrix corresponding to transient states. The entry $m_ij$ represents the expected time the chain spends in state $j$ given it started in state $i$.
Key problems:
Method:
The most searched-for problems. Key exercises (e.g., #15, #24, #41) involve:
Pro tip for solutions: Many online sources miscalculate the variance of a compound Poisson process. The correct solution uses Wald’s equation: $Var(X) = \lambda t E[Y^2]$.
Key problems:
Method:
Key ideas:
