Conditional Probability & Expectation - Statistics Graduate Level
- What is the approximate value of ? Answer: Whenever you see a conditional expectation problem involving a truncated normal distribution, your first instinct should be to use the law of total expectation combined with direct computation via the normal density. Since , the tower property gives . This is because conditioning further on the event yields . So the problem reduces to computing the second moment of a standard normal truncated to . Using the truncated normal formula: The denominator is . For the numerator, use integration by parts: . Since , we get . So the numerator is . Therefore , confirming C. Choice A () ignores the truncation entirely — that's for an untruncated standard normal. Choice B () likely arises from computing only the numerator term and mishandling the denominator. Choice D () doubles the correct answer, a sign of forgetting to divide by the tail probability. Study tip: Memorize that — this identity appears repeatedly in truncated normal calculations on graduate-level exams.
- What is the posterior predictive probability that exactly one of the next two patients responds? Answer: When you see a Bayesian problem asking for a posterior predictive probability, your goal is to average the likelihood of future observations over the posterior distribution of the unknown parameter — not plug in a point estimate. Start by updating the prior. With and observing 3 successes and 1 failure, the posterior is , giving posterior mean . Now compute the posterior predictive probability that exactly 1 of the next 2 patients responds. You need: Using moments of : and . So: This confirms A is correct. Choice B, , is the trap of plugging the posterior mean directly into the binomial formula: — this ignores parameter uncertainty. Choice C, , is simply the posterior mean itself, mistaking it for a predictive probability. Choice D, , corresponds to using the prior mean and never updating. Key tip: Never substitute the posterior mean into a binomial formula for predictive probabilities — always integrate over the full posterior using moments.
- Let and be independent uniform random variables on , and let . What is ? Answer: When you see a conditional expectation involving order statistics, your instinct should be to work directly from the conditional distribution. Here, has CDF and PDF on . To find , you need the conditional PDF of given . First, compute . The conditional PDF is then: Now compute the conditional expectation: This confirms the answer is C. Choice A, , is the unconditional mean of — a classic trap when you forget to apply the conditioning. Choice B, , is itself, which students sometimes confuse with the conditional mean. Choice D, , likely comes from incorrectly using a uniform conditional density on rather than the correct triangular-shaped conditional PDF. The key study tip: always re-derive the conditional PDF by truncating and renormalizing the original density. Never assume the conditional distribution inherits the same functional form as the unconditional one.
- Independent event counts satisfy and . What is ? Answer: When you see a conditional expectation involving Poisson random variables with a sum constraint, reach for the key theorem: given , independent, the conditional distribution of is . Here that means . But you also need , so you're working with a truncated distribution. The conditional expectation becomes: Let , . Then , so . The unconditional binomial mean is , and since , we have . Therefore: This confirms B. Choice A, , is the binomial mean without truncation — forgetting the constraint. Choice C, , is actually , a probability mistaken for an expectation. Choice D, , is simply with no conditioning at all. When conditioning on multiple events, always decompose using — truncation changes the mean, and that denominator is the step students most often drop.
- The joint density of and is proportional to on the region and is zero elsewhere. What is ? Answer: When working with joint densities on non-rectangular regions, your first instinct should be to find the normalizing constant, then carefully set up conditional probability using the definition . Start by finding such that . The inner integral gives , so the double integral equals . Thus and on . Now compute . Integrate over , : Next, requires splitting into regions: . For , runs from to : So , confirming C. Choice A () ignores conditioning entirely. Choice B () likely comes from forgetting the factor of 2 or misidentifying the integration region. Choice D () results from computing incorrectly as . Study tip: Always sketch the support region before integrating — on triangular domains like , the limits change depending on which event you're conditioning on, and a diagram prevents costly region errors.
- What is ? Answer: When a sum has a random number of terms, the key tool is the law of total expectation: . Start by conditioning on , then average over the randomness in itself. Given , the conditional expectation of the sum is: Notice that no conditional independence assumption is needed here — you only need the conditional mean of each , not anything about their joint distribution. Now apply the law of total expectation: Since , you have and , so . Therefore: The correct answer is D. Choice A () likely comes from computing alone and ignoring the -dependent mean structure. Choice B () might arise from computing without adding . Choice C () could result from forgetting to account for the variance term when computing , mistakenly using instead of . The study tip: whenever you see in a Poisson problem, always decompose it as . Forgetting the variance term is one of the most common computational errors on graduate-level probability exams.
- Suppose and are square-integrable random variables satisfying almost surely. Which statement must hold for every bounded measurable function ? Answer: whenever the covariance is defined. When you see a condition like , your instinct should be to explore what it implies about covariances — not independence or symmetry. This condition means is "mean-independent" of , which is weaker than full independence but still has powerful covariance consequences. Here's why D is correct. For any bounded measurable , you can compute: By the tower property (iterated expectations): So — exactly as D claims. Now for the distractors. A is wrong because mean-independence does not imply full independence. You can construct examples where yet the joint distribution is not a product measure. B is wrong because the conditional expectation condition is not symmetric — knowing says nothing about . These are distinct properties, and neither implies the other in general. C is wrong because while and the second term vanishes (since is constant), this only tells you — not that equals almost surely. Study tip: The tower property is your best tool whenever conditional expectations appear — always ask whether you can condition inside an expectation to exploit a given constraint.
- A random variable takes values with probabilities , respectively. Let be the sigma-field generated by the event . What is ? Answer: When you see a conditional expectation with respect to a sigma-field generated by a single event, recognize that partitions the sample space into exactly two atoms: and . The conditional expectation is therefore a step function — constant on each atom. First, compute : . On (probability 0.3): . On (probability 0.7): . Now compute by summing over all four values. For : ; for : ; for : ; for : . Weighting: , confirming A. Choice B () is , a common confusion — you're asked for variance around the conditional mean, not the unconditional variance. Choice C mixes intermediate calculations incorrectly. Choice D would only be correct if were the full sigma-field generated by itself, making the residual identically zero. Remember: measures the unexplained variance after conditioning — it equals by the law of total variance, which you can use as a check.
- What is ? Answer: When conditioning on multiple events simultaneously, your first instinct should be to identify the joint conditional distribution carefully — especially when competing exponentials are involved. Here, you need . By the memoryless property of exponentials, conditioning on and shifts both clocks: let and , independently. The condition becomes . So the problem reduces to finding . For independent exponentials with rates and , the conditional expectation equals . This is a standard result: given that "wins" the race, the winning time is , giving mean . Therefore , confirming B. Choice A () forgets to add back the shifted baseline of 1 after applying the memoryless property. Choice C () likely confuses the combined rate with but adds incorrectly, or misapplies the unconditional mean of . Choice D () is simply the unconditional mean ... wait — it may reflect treating the problem as just with the wrong rate, ignoring all conditioning. Study tip: Always apply the memoryless property first to simplify conditioning on survival past a threshold, then use the competing-exponentials "race" formula for the residual.
- Given that the randomly selected participant tests positive, what is the probability that the participant came from Region A? Answer: Whenever you see a question involving conditional probability across multiple subgroups, reach for Bayes' theorem combined with the law of total probability. Here, you need to find the probability a positive test came from Region A — meaning you must work backward from an observed outcome. Start by computing the probability of testing positive in each region. For Region A: . For Region B: . Now apply total probability: . Finally, Bayes' theorem gives: , confirming A is correct. Choice B (0.400) is the trap of simply reporting the prior probability of Region A — ignoring the diagnostic information entirely. Choice C (0.790) likely results from omitting the false-positive term when computing , underestimating Region B's contribution to positive tests. Choice D (0.667) resembles an incorrect ratio using only the true-positive components without properly weighting by region priors. Strategy tip: In multi-group Bayes problems, always compute the full using both sensitivity and false-positive rate — forgetting false positives is the single most common error on these problems.