Question on Probability & Uniform Distribution.

Sunil12
Messages
3
Reaction score
0
Suppose a sample of random size N is taken from the continuous uniform(0, θ)
distribution, and N has a discrete distribution with p.m.f.

P (N = n) = 1/(n! (e − 1) ) for n = 1, 2, 3, . . . .

Determine the distribution of the
i) first order statistic (the minimum) of X1 , X2, . . . , XN .
ii) highest order statistic (the maximum) of X1, X2, . . ., XN .

Please help me to solve this problem.
 
Physics news on Phys.org
Sounds like homework. What have you tried? What do you know in general about the distribution of order statistics?
 
Generally the distribution of Xi in a order statistic is Binomial. Isn't it ? because given a value 'a' Xi is either Xi < a or Xi>=a. It is like a success failure.
 
To get you started, P[max<=x|N=n] = P[X1<=x,...,Xn<=x]=P[X1<=x]^n, then simply take the expectation wrt N.
 
Sunil12 said:
Generally the distribution of Xi in a order statistic is Binomial. Isn't it ? because given a value 'a' Xi is either Xi < a or Xi>=a. It is like a success failure.

Not quite. If you know that

<br /> P(X_n \le a)<br />

(X_n is the largest order statistic) then you know that ALL the other values are less than or equal to a, so

<br /> P(X_n \le a) = P(X1 \le a \text{ and } X2 \le a \text{ and } \cdots \text{ and } Xn \le a)<br /> = \left(P(X \le a)\right)^n = F(a)^n<br />

by independence. To work with the minimum start with

<br /> P(X_{(1)} &gt; a)<br />

and think about what it means for the smallest item in the sample to be larger than some value.
 
FX1(a) = 1 - P(X1 > a)

which will essentially be 1 - (1 - Fx(x))n

Right ?
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top