jimmy7430
- 2
- 0
Let Pr(X_{i} = +1) =\frac{2}{3} = 1 - Pr(X_{i} = -1), and S_{n} = \sum{X_{i}}, For each k≥1, define T_{k}\ =\ min \left\{n≥1: S_{n} = k \right\}. Calculate E[T_k], and Var[T_k].
2. Homework Equations
E[T_k] = \sum_{n=1}^{n=∞}{n Pr(T_k = n)}, and E[T_k]^2 = \sum_{n=1}^{n=∞}{n^2 Pr(T_k = n)} will be used.
k is given as an known constant. A theorem says Pr(T_k = n ) = Pr(S_{1} S_{2} ... S_{n} ≠ 0, S_{n} = k) = \frac{|b|}{n}Pr(S_n = k), and
Pr(S_n = k) = \left( \stackrel{n}{\frac{1}{2}(n+k)} \right) p^{\frac{1}{2}(n+k)}q^{\frac{1}{2}(n-k)}
IMHO, problem should be asolved. However, It doesn't seem to have a nice expression. My guess will be use Sterling approximation, or Mathematica. Any comments are welcome.
2. Homework Equations
E[T_k] = \sum_{n=1}^{n=∞}{n Pr(T_k = n)}, and E[T_k]^2 = \sum_{n=1}^{n=∞}{n^2 Pr(T_k = n)} will be used.
The Attempt at a Solution
k is given as an known constant. A theorem says Pr(T_k = n ) = Pr(S_{1} S_{2} ... S_{n} ≠ 0, S_{n} = k) = \frac{|b|}{n}Pr(S_n = k), and
Pr(S_n = k) = \left( \stackrel{n}{\frac{1}{2}(n+k)} \right) p^{\frac{1}{2}(n+k)}q^{\frac{1}{2}(n-k)}
IMHO, problem should be asolved. However, It doesn't seem to have a nice expression. My guess will be use Sterling approximation, or Mathematica. Any comments are welcome.