/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Problem 39 An individual traveling on the r... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

An individual traveling on the real line is trying to reach the origin. However, the larger the desired step, the greater is the variance in the result of that step. Specifically, whenever the person is at location \(x\), he next moves to a location having mean 0 and variance \(\beta x^{2}\). Let \(X_{n}\) denote the position of the individual after having taken \(n\) steps. Supposing that \(X_{0}=x_{0}\), find (a) \(E\left[X_{n}\right]\) (b) \(\operatorname{Var}\left(X_{n}\right)\)

Short Answer

Expert verified
In summary, the expected location after n steps, \(E[X_n]\), is 0 and the variance of the individual's position after n steps, \(\operatorname{Var}(X_n)\), is \(\beta^n E[X_0^2]\).

Step by step solution

01

State the Definition of Expected Value and Variance

The expected value of a random variable \(X\) is defined as \(E[X] = \sum_i x_i P(x_i)\), where \(x_i\) are the possible values of the random variable and \(P(x_i)\) are the probabilities associated with these values. The variance of a random variable \(X\) is defined as \(\operatorname{Var}(X) = E[X^2] - (E[X])^2\).
02

Find the Expression of \(E[X_n]\)

Given the information in the problem, we can find the expected location at the nth step \(E[X_n]\) using conditional expectation. We know that the mean of the next step, \(E[X_{n+1} | X_n]\), is 0. Therefore, \(E[X_{n+1} | X_n] = 0\) Now we can write the expression for \(E[X_n]\) using conditional expectation: \(E[X_n] = E[E[X_n | X_{n-1}]]\) \(E[X_n] = E[0]\) \(E[X_n] = 0\) So, the expected location after n steps, \(E[X_n]\), is 0.
03

Find the Expression of \(\operatorname{Var}(X_n)\)

Now we need to find the variance of the nth step, \(\operatorname{Var}(X_n)\). Using the definition of variance, we know that: \(\operatorname{Var}(X_n) = E[X_n^2] - (E[X_n])^2\) Since we know that \(E[X_n] = 0\), we just need to find \(E[X_n^2]\). Using conditional expectation, we can write: \(E[X_n^2] = E[E[X_n^2 | X_{n-1}]]\) Given that the variance of the individual's position at location \(x\) is \(\beta x^2\), we have: \(E[X_n^2] = E[\operatorname{Var}(X_n | X_{n-1}) + (E[X_n | X_{n-1}])^2]\) Since \(E[X_n | X_{n-1}] = 0\), we have: \(E[X_n^2] = E[\operatorname{Var}(X_n | X_{n-1})]\) \(E[X_n^2] = E[\beta X_{n-1}^2]\) Now, by using the law of iterated expectations, \(E[X_n^2] = \beta E[X_{n-1}^2] = \beta^n E[X_0^2]\) Now we can find the variance of the nth step: \(\operatorname{Var}(X_n) = E[X_n^2] - (E[X_n])^2\) \(\operatorname{Var}(X_n) = \beta^n E[X_0^2] - 0\) \(\operatorname{Var}(X_n) = \beta^n E[X_0^2]\) Thus, the variance of the individual's position after n steps, \(\operatorname{Var}(X_n)\), is \(\beta^n E[X_0^2]\). To summarize: (a) The expected location after n steps, \(E[X_n]\), is 0. (b) The variance of the individual's position after n steps, \(\operatorname{Var}(X_n)\), is \(\beta^n E[X_0^2]\).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Let \(X_{1}, X_{2}, \ldots\) be independent continuous random variables with a common distribution function \(F\) and density \(f=F^{\prime}\), and for \(k \geq 1\) let $$ \left.N_{k}=\min \mid n \geq k: X_{n}=k \text { th largest of } X_{1}, \ldots, X_{n}\right] $$ (a) Show that \(P\left[N_{k}=n\right]=(k-1) / n(n-1), n \geq k\). (b) Argue that $$ f_{X_{0}}(x)=f(x)(\bar{F}(x))^{k-1} \sum_{i=0}^{\infty}\left(\begin{array}{c} i+k-2 \\ i \end{array}\right)(F(x))^{t} $$ (c) Prove the following identity: $$ a^{1-k}=\sum_{i=0}^{\infty}\left(\begin{array}{c} i+k-2 \\ i \end{array}\right)(1-a)^{t}, \quad 0

In Section 3.6.3, we saw that if \(U\) is a random variable that is uniform on \((0,1)\) and if, conditional on \(U=p, X\) is binomial with parameters \(n\) and \(p\), then $$ P[X=t\\}=\frac{1}{n+1}, \quad i=0,1, \ldots, n $$ For another way of showing this result, let \(U, X_{1}, X_{2}, \ldots, X_{n}\) be independent uniform \((0,1)\) random variables. Define \(X\) by $$ \boldsymbol{X}=\boldsymbol{h i}: \boldsymbol{X}_{i}<\boldsymbol{U} $$ That is, if the \(n+1\) variables are ordered from smallest to largest, then \(U\) would be in position \(X+1\). (a) What is \(P[X=i] ?\) (b) Explain how this proves the result stated in the preceding.

\(A, B\), and \(C\) have evenly matched tennis players. Initially \(A\) and \(B\) play a set, and the winner then plays \(C\). This continues, with the winner always playing the waiting player, until one of the players has won two sets in a row. That player is then declared the overall winner. Find the probability that \(A\) is the overall winner.

The joint density of \(X\) and \(Y\) is \(f(x, y)=\frac{\left(y^{2}-x^{2}\right)}{8} e^{-y}, \quad 0

Show in the discrete case that if \(X\) and \(Y\) are independent, then $$ E[X \mid Y=y]=E[X] \quad \text { for all } y $$

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.