Chapter 7: Q. 7.52 (page 363)
Show how to compute from the joint moment generating function of and .
Short Answer
The Computefrom the joint moment generating function value are.
/*! 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}
Learning Materials
Features
Discover
Chapter 7: Q. 7.52 (page 363)
Show how to compute from the joint moment generating function of and .
The Computefrom the joint moment generating function value are.
All the tools & learning materials you need for study success - in one app.
Get started for free
Let be the standard normal distribution function, and let X be a normal random variable with mean μ and variance 1. We want to find E[ (X)]. To do so, let Z be a standard normal random variable that is independent of X, and let
(a) Show that .
(b) Show that .
(c) Show that .
Hint: What is the distribution of ?
The preceding comes up in statistics. Suppose you are about to observe the value of a random variable X that is normally distributed with an unknown mean μ and variance 1, and suppose that you want to test the hypothesis that the mean μ is greater than or equal to 0. Clearly you would want to reject this hypothesis if X is sufficiently small. If it results that X = x, then the p-value of the hypothesis that the mean is greater than or equal to 0 is defined to be the probability that X would be as small as x if μ were equal to 0 (its smallest possible value if the hypothesis were true). (A small p-value is taken as an indication that the hypothesis is probably false.) Because X has a standard normal distribution when μ = 0, the p-value that results when X = x is (x). Therefore, the preceding shows that the expected p-value that results when the true mean is μ is .
Show that is stochastically larger than if and only if
for all increasing functions .
Hint: Show that , then by showing that and then using Theoretical Exercise 7.7. To show that if for all increasing functions , then , define an appropriate increasing function .
A deck of n cards numbered 1 through n is thoroughly shuffled so that all possible n! orderings can be assumed to be equally likely. Suppose you are to make n guesses sequentially, where the ith one is a guess of the card in position i. Let N denote the number of correct guesses.
(a) If you are not given any information about your earlier guesses, show that for any strategy, E[N]=1.
(b) Suppose that after each guess you are shown the card that was in the position in question. What do you think is the best strategy? Show that under this strategy
(c) Supposethatyouaretoldaftereachguesswhetheryou are right or wrong. In this case, it can be shown that the strategy that maximizes E[N] is one that keeps on guessing the same card until you are told you are correct and then changes to a new card. For this strategy, show that
Hint: For all parts, express N as the sum of indicator (that is, Bernoulli) random variables.
The joint density of and is given by
Compute .
The best linear predictor of with respect toand is equal to , where , , and are chosen to minimize Determine , , and .
What do you think about this solution?
We value your feedback to improve our textbook solutions.