I remembered the fair coin case pretty quickly, probability of ruin is just (N-i)/N, which feels intuitive in hindsight.
Start by setting up the recurrence relation for the probability of ruin, then solve it for the fair coin case using the boundary conditions. For the biased case, solve the resulting linear recurrence with the appropriate roots, and present the final formulas clearly.
Pro tip: Emphasize the intuition behind the formulas: for a fair game, the probability of ruin is linear in the starting capital, while for a biased game, it depends exponentially on the ratio of loss to win probabilities. This shows you understand the underlying dynamics, not just the algebra.
Let P_i be the probability of ruin starting with i dollars. The game stops at 0 (ruin) or N (success). For a fair coin, the probability of winning or losing each bet is 0.5.
For 0 < i < N, P_i = 0.5 * P_{i-1} + 0.5 * P_{i+1}. The boundary conditions are P_0 = 1 and P_N = 0.
The general solution is linear: P_i = A + B*i. Applying boundary conditions gives P_i = 1 - i/N.
Let p be the win probability and q = 1-p. The recurrence becomes P_i = p * P_{i+1} + q * P_{i-1}. Solve the characteristic equation to get P_i = ( (q/p)^i - (q/p)^N ) / ( 1 - (q/p)^N ) for p ≠ 0.5, and P_i = 1 - i/N for p = 0.5.
Explain the implications: for p ≤ 0.5, ruin is certain as N → ∞; for p > 0.5, there's a positive chance of reaching N. Mention the martingale argument for the fair case.
AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.
The return probability being 1 in 1D I knew.
Start by solving the 1D case using generating functions or martingale arguments to derive the return probability and expected return time. Then generalize to higher dimensions using Fourier analysis or the potential kernel, highlighting the critical difference in the convergence of the integral. Conclude by connecting the recurrence/transience dichotomy to the divergence/convergence of the expected number of returns.
Pro tip: Mention that the expected return time in 1D is infinite despite recurrence, which often surprises interviewers and shows depth. Also, relate the 3D transience to the fact that the random walk has a positive probability of never returning, which is a key insight for applications like graph exploration.
Clearly state that we consider a simple symmetric random walk on Z^d starting at 0. Define the first return time T = inf{n>0: S_n = 0} and the return probability p = P(T < ∞).
Use generating functions or the reflection principle to show that P(T = 2n) = (1/(2n-1)) * C_{2n}^n / 2^{2n} and sum to get p = 1. Then compute E[T] = ∞ by showing the sum diverges.
Express the return probability via the Fourier integral p = 1 - 1/( (2π)^d ∫_{[-π,π]^d} (1 - φ(θ))^{-1} dθ ), where φ(θ) = (1/d)∑ cos θ_i. Analyze the convergence of the integral near θ=0.
Show that the integral diverges for d=1,2 (since 1-φ(θ) ~ |θ|^2/2d) and converges for d≥3 (since the singularity is integrable in higher dimensions). Conclude p=1 for d=1,2 and p<1 for d≥3.
State that recurrence is equivalent to the expected number of returns being infinite, while transience means finite expected returns. Emphasize that in 1D the walk returns infinitely often but with infinite mean return time.
AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.