Exercise. Let (Sn)n>o be a biased random walk started from 0. That is, n Sn = $k k=1 where (Ek) k>1 is a sequence of ind
Posted: Thu May 05, 2022 7:44 pm
Exercise. Let (Sn)n>o be a biased random walk started from 0. That is, n Sn = $k k=1 where (Ek) k>1 is a sequence of independent, identically distributed ran- dom variables with P(₁ = 1) = p = 1 - P(₁ = -1) for p > 1/2. Use the strong law of large numbers to show that T = sup{n> 0: Sn=0} is almost surely finite.