Distribution of Maximum of Two Random Variables

[EngWiPy]

Hi all,

I have a random variable (RV):

$$X=\text{max}X_i+X_j$$

where Xi and Xj are two different RVs from a set of i.i.d N RVs. I need to find the distribution of X. What is the most efficient way?

Thanks in advance

 

[chiro]

Hi all,

I have a random variable (RV):

$$X=\text{max}X_i+X_j$$

where Xi and Xj are two different RVs from a set of i.i.d N RVs. I need to find the distribution of X. What is the most efficient way?

Thanks in advance

Hey S_David.

For this problem you can use order statistics and the convolution theorem to get what you want.

The order statistics is used for getting the Max(X) term and the convolution is used to calculate the distribution for summing independent (but not necessarily indentically distributed) random variables.

Are you familiar with these?

 

[EngWiPy]

Hey S_David.

For this problem you can use order statistics and the convolution theorem to get what you want.

The order statistics is used for getting the Max(X) term and the convolution is used to calculate the distribution for summing independent (but not necessarily indentically distributed) random variables.

Are you familiar with these?

I worked with order statistics when I choose one random variable, but in this case I need to pick the maximum two random variables. The problem is that the distribution of each component is very complicated, and I need a way that I can handle this. Actually:

$$X_i=\|h_{1i}\|^2\|h_{2i}\|^2$$

where each of the components in the multiplication is Chi-square RV with 2L degrees of freedom.

Thanks

 

[chiro]

I worked with order statistics when I choose one random variable, but in this case I need to pick the maximum two random variables. The problem is that the distribution of each component is very complicated, and I need a way that I can handle this. Actually:

$$X_i=\|h_{1i}\|^2\|h_{2i}\|^2$$

where each of the components in the multiplication is Chi-square RV with 2L degrees of freedom.

Thanks

One idea that comes to mind is to use a transformation technique.

One suggestion I have is to find the pdf/cdf of the square of a chi-squared distribution. Is this what you mean when you use a norm-squared term?

After this you could use other techniques to find your expression where you multiply two norm-squared terms to get the pdf/cdf of your X_i.

After that you can use other techniques like order statistics and convolution to do the rest.

 

[SW VandeCarr]

Hi all,

I have a random variable (RV):

$$X=\text{max}X_i+X_j$$

where Xi and Xj are two different RVs from a set of i.i.d N RVs. I need to find the distribution of X. What is the most efficient way?

Thanks in advance

These can get fairly complicated:

$fX(i),X(j)(u, v) = \frac {n!}{(i − 1)!(j − 1 − i)!(n − j)!} fX(u)fX(v)[FX(u)]i−1[FX(v)−FX(u)]j−1−i[1−FX(v)]n−j$

for $−\infty < u < v < \infty$

Maybe you can work backwards from this.

 

[EngWiPy]

One idea that comes to mind is to use a transformation technique.

One suggestion I have is to find the pdf/cdf of the square of a chi-squared distribution. Is this what you mean when you use a norm-squared term?

After this you could use other techniques to find your expression where you multiply two norm-squared terms to get the pdf/cdf of your X_i.

After that you can use other techniques like order statistics and convolution to do the rest.

The steps are clear in my mind, however, the details are very complicated and the results are very involved.

I hoped there was an easier way.

Thanks anyway

 

[EngWiPy]

These can get fairly complicated:

$fX(i),X(j)(u, v) = n! (i − 1)!(j − 1 − i)!(n − j)! fX(u)fX(v)[FX(u)]i−1[FX(v)−FX(u)]j−1−i[1−FX(v)]n−j$

for $−\infty < u < v < \infty$

Maybe you can work backwards from this.

What are these? I am sorry, but I did not get it.

Thanks

 

[SW VandeCarr]

What are these? I am sorry, but I did not get it.

Thanks

Sorry. Bad Latex. It should be the joint pdf of X(i),(Xj). This is what you asked for, isn't it?

$fX(i),X(j)(u, v) = \frac {n!} {(i − 1)!(j − 1 − i)!(n − j)!} fX(u)fX(v)[FX(u)]i−1[FX(v)−FX(u)]j−1−i[1−FX(v)]n−j$
for $-\infty< u < v < \infty$

 

[EngWiPy]

Sorry. Bad latex. It should be the joint pdf of X(i),Xj). This is what you asked for, isn't it?

$fX(i),X(j)(u, v) = \frac {n}! {(i − 1)!(j − 1 − i)!(n − j)!} fX(u)fX(v)[FX(u)]i−1[FX(v)−FX(u)]j−1−i[1−FX(v)]n−j$
for $-\infty< u < v < \infty$

Yeah, I need the joint p.d.f of the summation of the maximum two RVs.

 

[SW VandeCarr]

Yeah, I need the joint p.d.f of the summation of the maximum two RVs.

You quoted it before I could correct another mistake. I think it's OK now.

 

[SW VandeCarr]

Here's a reference that might help:

http://www.markirwin.net/stat110/Lecture/Section37.pdf

 

[EngWiPy]

Here's a reference that might help:

http://www.markirwin.net/stat110/Lecture/Section37.pdf

Thanks. I'll check this.

 

[viraltux]

Hi all,

I have a random variable (RV):

$X=\text{max}X_i+X_j$

where Xi and Xj are two different RVs from a set of i.i.d N RVs. I need to find the distribution of X. What is the most efficient way?

Thanks in advance

If N is large enough you can use Extreme Value Theory distribution for $$\text{max}X_i$$ instead order statistics which I think it would simplify the calculations... Good luck!