代写553.420/620 Intro. to Probability Assignment #10代做Python编程

553.420/620 Intro. to Probability

Assignment #10

10.1. In class we showed that when X1 ∼ Gamma(α1, 1) and X2 ∼ Gamma(α2, 1) are independent, then


U1 = X1+X2/X1 ∼ Beta(α1, α2) by using method of Jacobians (taking U2 = X1 +X2). In this problem I want you to extend this result: Let X1 ∼ Gamma(α1, 1), X2 ∼ Gamma(α2, 1), X3 ∼ Gamma(α3, 1) be independent. Set



(a) Derive the joint PDF fU1,U2,U3 (u1, u2, u3) of U1, U2, U3.

(b) Integrate out u3 to find the joint (marginal) PDf fU1,U2 (u1, u2) of U1, U2.

Remark. Regarding part (b): This marginal is an example of the Dirichlet distribution and is to the multi-nomial distribution as the Beta distribution is to the binomial distribution. In general, if X1, X2, . . . , Xk+1 are independent and Xi ∼ Gamma(αi , 1) for i = 1, 2, . . . , k + 1 and, for 1 ≤ j ≤ k, Uj = X1···+Xk+1/+Xj, and Uk+1 = X1 + · · · + Xk+1, then it can be shown that, for 0 < uj < 1, j = 1, 2, . . . , k and 0 < u1 + · · · + uk < 1:



10.2. (independence and uncorrelated are not quite the same thing) In order to define the covariance between two random variables it is necessary for these random variables to possess a finite mean value: Cov(X, Y ) = E[(X − E(X))(Y − E(Y ))]. But random variables can be independent with possessing a finite mean value, for example, just consider two independent Cauchy rvs or Zeta(2) rvs. Therefore, independence does not imply uncorrelated. However, if independent rvs each have a finite mean, then their covariance is 0 (and are therefore uncorrelated). Show this, i.e., you have to show that if X and Y are independent and have finite means, then E(XY ) − E(X)E(Y ) = 0.

(b) Consider the discrete rv X with PMF P(X = −1) = 4/1 = P(X = 1), P(X = 0) = 2/1 . Let Y = X2 . Show that X, Y are uncorrelated and not independent.

For part (b), in order to show they are not independent you have to show that the joint PMF is not the product of the marginal PMFs.

10.3 (a) Let X1, X2, . . . , Xn be rvs that have finite means and variances. Show that, for any constants a1, a2, . . . , an,



(b) Write down what part (a) says in the special case n = 2.

(c) What does part (a) tell us about the variance of a sum when the rvs are uncorrelated? Write it down.

(d) Now suppose X and Y are independent. Find a value of a with 0 ≤ a ≤ 1 such that V ar(aX + (1 − a)Y ) is minimized.

10.4. X1, X2, X3, . . . are a sequence of i.i.d. uniform(0, 1) random variables.

(a) For each fixed n, find the CDF of X(1), the smallest among X1, X2, . . . , Xn.

(b) For each fixed n, find the CDF of nX(1) = n min{X1, X2, . . . , Xn}.

(c) Compute limn→∞ FnX(1) (x). Does this CDF look familiar? If so, what is it?

10.5. Suppose N ∼ Poisson(λ) with λ > 0. Conditioned on N = n, X ∼ binomial(n, p), i.e., X|N ∼ binomial(N, p). Let Y = N − X.

(a) Show that X and Y each have Poisson distributions with respective parameters λp and λ(1 − p).

(b) Show that X and Y are, in fact, independent random variables! This shows that conditionally dependent random variables can be made independent through randomization.



10.6. Four people offer bids on an item; say the bid from person i is a continuous rv Xi . Assume the bids are independent and all share the same pdf f(x). The winning bid is the largest bid. The following are separate questions. If there is not enough information to answer, say so.

Compute the probability that. . .

(a) person 4 has the winning bid.

(b) X1 > X2 > X3.

(c) X1 > X2 > X3 and person 4 has the winning bid.

(d) X1 > X2 > X3 and person 4 does not have the winning bid.

(e) person 4 has the winning bid and person 1’s bid is not the lowest bid.

(f) the largest bid among the four people is at least $1 more than the next largest bid.

10.7. We have 5 iid uniform(0,1) rvs X1, X2, X3, X4, X5. Find easy ways to compute each of the following if possible.

(a) the probability the smallest of these is X5.

(b) the probability that X1 < X2.

(c) the probability that X1, X3 and X5 are monotone, i.e., either X1 < X3 < X5 or X1 > X3 > X5.

(d) the probability that X5 is the largest and X1 is not the smallest.

10.8. X, Y, Z have the joint PDF f(x, y, z) = 4xyz(x + y + z) for 0 < x < 1, 0 < y < 1, 0 < z < 1.

Compute P(X < Y |Z > max{X, Y }).

Remark. It would be great if you could do this without doing any calculus.

10.9. We have 4 A’s, 4 B’s, and 4 C’s. We randomly disburse these 12 into 4 groups of 3 each. Compute the expected number of groups containing one each of A, B and C.

10.10. A dish has 1 yellow, 1 red, 2 green and 6 blue m&m’s. A person randomly selects 3.

(a) Let X count the number of blue candies in the selection. Compute E(X).

(b*) Let Y count the number of different colors in the selection. Compute E(Y ).

*Please find a way of computing this expected value without deriving the distribution of Y .

10.11. A spinner has 4 equally likely regions. Compute the expected number of spins it will take to see every region hit (at least once).




热门主题

课程名

mktg2509 csci 2600 38170 lng302 csse3010 phas3226 77938 arch1162 engn4536/engn6536 acx5903 comp151101 phl245 cse12 comp9312 stat3016/6016 phas0038 comp2140 6qqmb312 xjco3011 rest0005 ematm0051 5qqmn219 lubs5062m eee8155 cege0100 eap033 artd1109 mat246 etc3430 ecmm462 mis102 inft6800 ddes9903 comp6521 comp9517 comp3331/9331 comp4337 comp6008 comp9414 bu.231.790.81 man00150m csb352h math1041 eengm4100 isys1002 08 6057cem mktg3504 mthm036 mtrx1701 mth3241 eeee3086 cmp-7038b cmp-7000a ints4010 econ2151 infs5710 fins5516 fin3309 fins5510 gsoe9340 math2007 math2036 soee5010 mark3088 infs3605 elec9714 comp2271 ma214 comp2211 infs3604 600426 sit254 acct3091 bbt405 msin0116 com107/com113 mark5826 sit120 comp9021 eco2101 eeen40700 cs253 ece3114 ecmm447 chns3000 math377 itd102 comp9444 comp(2041|9044) econ0060 econ7230 mgt001371 ecs-323 cs6250 mgdi60012 mdia2012 comm221001 comm5000 ma1008 engl642 econ241 com333 math367 mis201 nbs-7041x meek16104 econ2003 comm1190 mbas902 comp-1027 dpst1091 comp7315 eppd1033 m06 ee3025 msci231 bb113/bbs1063 fc709 comp3425 comp9417 econ42915 cb9101 math1102e chme0017 fc307 mkt60104 5522usst litr1-uc6201.200 ee1102 cosc2803 math39512 omp9727 int2067/int5051 bsb151 mgt253 fc021 babs2202 mis2002s phya21 18-213 cege0012 mdia1002 math38032 mech5125 07 cisc102 mgx3110 cs240 11175 fin3020s eco3420 ictten622 comp9727 cpt111 de114102d mgm320h5s bafi1019 math21112 efim20036 mn-3503 fins5568 110.807 bcpm000028 info6030 bma0092 bcpm0054 math20212 ce335 cs365 cenv6141 ftec5580 math2010 ec3450 comm1170 ecmt1010 csci-ua.0480-003 econ12-200 ib3960 ectb60h3f cs247—assignment tk3163 ics3u ib3j80 comp20008 comp9334 eppd1063 acct2343 cct109 isys1055/3412 math350-real math2014 eec180 stat141b econ2101 msinm014/msing014/msing014b fit2004 comp643 bu1002 cm2030
联系我们
EMail: 99515681@qq.com
QQ: 99515681
留学生作业帮-留学生的知心伴侣!
工作时间:08:00-21:00
python代写
微信客服:codinghelp
站长地图