Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Let X(i),i=1,,ndenote the order statistics from a set of nuniform (0,1)random variables, and note that the density function of X(i)is given by f(x)=n!(i-1)!(n-i)!xi-1(1-x)n-i0<x<1

(a) Compute VarX(i),i=1,,n

(b) Which value of iminimizes, and which value maximizes, VarX(i)?

Short Answer

Expert verified

a) The computing value of VarX(i),i=1,,nis i[n+1]-i2(n+1)2(n+2).

b) The value of i=(n+1)Minimizes the VarX(i);i=1,2,.,n

And the value of i=n+12Maximizes theVarX(i);i=1,2,..,n

Step by step solution

01

Given Information (Part a)

Order statistics VarX(i),i=1,,n

Uniform Random variables (0,1)

Given function f(x)=n!(i-1)!(n-i)!xi-1(1-x)n-i0<x<1

02

Explanation (Part a)

We have that,

EX(i)=01n!(i1)!(ni!)xxi1(1x)nidx;0<x<1i=1,2,,n

=n!(i1)!(ni!)01xi(1x)nidx

localid="1647417641323" =n!(i1)!(ni)!(i)!(ni)!(n+1)!

=n!(i1)!(ni)!(i)!(ni)!(n+1)!

=in+1

03

Explanation (Part a) 

Calculate the value ofE[X2(i)],

EX(i)2=n!(i-1)!(n-i)!01xi+1(1-x)n-idx

=n!(i1)!(ni)!(i+1)!(ni)!(i+2+ni+11)!

localid="1647417779471" =n!(i1)!(ni)!(i+1)!(ni)!(n+2)!

=i(i+1)(n+1)(n+2)

04

Explanation (Part a)

Above results are calculated on the Basis of following result:

01xa1(1x)b1dx=(a1)!(b1)!(a+b1)!

=i(i+1)(n+1)(n+2)i2(n+1)2

=i2+i[n+1]i2[n+2](n+1)2(n+2)

localid="1647418098408" =i2[n+1n2]+i[n+1](n+1)2(n+2)

=i[n+1]i2(n+1)2(n+2)

05

Final Answer (Part a)

Therefore, the computing value of VarX(i),i=1,,nis i[n+1]-i2(n+1)2(n+2).

06

Given Information (Part b) 

Order statistics VarX(i),i=1,,n

Uniform Random variables (0,1)

Given functionf(x)=n!(i1)!(ni)!xi1(1x)ni0<x<1.

07

Explanation 

Calculate the variance,

VarX(i)=i[n+1]i2(n+1)2(n+2)=f(i)

df(i)di=1(n+1)2(n+2)ddii(n+1)i2

=1(n+1)2(n+2)([n+1]2i)

role="math" localid="1647527486280" df(i)di=0

i=n+12

d2f(i)di=2(n+1)2(n+2)<0

VarX(i) is maximum ati=n+12

08

Final Answer 

Now we know that the minimum (least) value of variance can be zero.

From (1) we see that for i=(n+1)

Therefore, i=(n+1)Minimizes the VarX(i);i=1,2,,n

Andi=n+12 Maximizes theVarX(i);i=1,2,..,n

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 Vaia!

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

The joint density function ofXandYis given by

f(x,y)=1ye-(y+x/y),x>0,y>0

Find E[X],E[Y]and show that Cov(X,Y)=1

Let Z be a standard normal random variable,and, for a fixed x, set

X={ZifZ>x0otherwise

Show thatE[X]=12πex2/2.

Gambles are independent, and each one results in the player being equally likely to win or lose 1 unit. Let W denote the net winnings of a gambler whose strategy is to stop gambling immediately after his first win. Find

(a) P{W > 0}

(b) P{W < 0}

(c) E[W]

A coin having probability p of landing on heads is flipped n times. Compute the expected number of runs of heads of size 1 , of size 2 , and of size k,1kn.

Two envelopes, each containing a check, are placed in front of you. You are to choose one of the envelopes, open it, and see the amount of the check. At this point, either you can accept that amount or you can exchange it for the check in the unopened envelope. What should you do? Is it possible to devise a strategy that does better than just accepting the first envelope? Let Aand B, A<B, denote the (unknown) amounts of the checks and note that the strategy that randomly selects an envelope and always accepts its check has an expected return of (A+B)/2. Consider the following strategy: Let F(·)be any strictly increasing (that is, continuous) distribution function. Choose an envelope randomly and open it. If the discovered check has the value x, then accept it with probability F(x)and exchange it with probability 1F(x).

(a) Show that if you employ the latter strategy, then your expected return is greater than (A+B)/2. Hint: Condition on whether the first envelope has the value Aor B. Now consider the strategy that fixes a value x and then accepts the first check if its value is greater than x and exchanges it otherwise. (b) Show that for any x, the expected return under thex-strategy is always at least (A+B)/2and that it is strictly larger than (A+B)/2if xlies between Aand B.

(c) Let X be a continuous random variable on the whole line, and consider the following strategy: Generate the value ofX, and if X=x, then employ the x-strategy of part (b). Show that the expected return under this strategy is greater than (A+B)/2.

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.

Sign-up for free