Consider the recursion known as a first-order autoregression Xn bXn-1 + Zn b1. The following is...

Transcribed Image Text:

Consider the recursion known as a first-order autoregression Xn bXn-1 + Zn b1. The following is assumed true: E[Zn] = 0, E[Z2 Also E[ZnXn-j ±2,... Assume E[X Kindependent of n o all n; E[ZnZj] = 0 all nj. 1,2,... . Compute Rn(k) E[Xn Xn-k] for k = 0 for j +1, Consider the recursion known as a first-order autoregression Xn bXn-1 + Zn b1. The following is assumed true: E[Zn] = 0, E[Z2 Also E[ZnXn-j ±2,... Assume E[X Kindependent of n o all n; E[ZnZj] = 0 all nj. 1,2,... . Compute Rn(k) E[Xn Xn-k] for k = 0 for j +1,