How do we calculate the E(max(x,y))

  • Thread starter Thread starter ayman88
  • Start date Start date
Click For Summary
To calculate E(max(x,y)) for two independent geometric variables x and y with success probabilities p and q, one must first find the probability of the maximum using order statistics. This involves determining the probability density function f(y) and the cumulative distribution function F(y) for the variables. By applying the formula Y(n) = n * f(y) * [F(y)]^(n-1), the next step is to compute the expected value of Y(n). Proper definition of the variables' intervals is essential for accurate integration. Understanding these concepts is key to successfully calculating the expected maximum.
ayman88
Messages
1
Reaction score
0
if we have two Independent geomtrice variables x and y ,
with prob of success for x is p and for y is q
how do we calculate the E(max(x,y))
 
Last edited:
Physics news on Phys.org
First, using order statistics, find the probability of the maximum of x and y.

That is, Y(n) = n * f(y) * [F(y)]^(n-1)

Use the probability density function for f(y), and the cumulative distribution function for F(y) (or just integrate the density function f(y)).

Once you have Y(n), finding its expected value is as simple as applying the definition. Also, make sure your variables are defined on the correct intervals. This will be crucial for integration.
 
Last edited:
The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
4
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K