I have two types of variables $X_{l,m}$ and $Y_m$. All $X_{l,m}$ are i.i.d distributed according to some probability distribution. Similarly all $Y_m$ are i.i.d distributed according to some other probability distribution. I want to find the following probability $$P\left(\max_{l=1 \cdots L}\left\{\min_{m=1\cdots M}\left(X_{l,m}+Y_m\right)\right\} My Strategy: 1- First find the PDF and CDF of a generic sum $Z=X+Y$. 2- Find the PDF and CDF of $$T=\min_{m=1\cdots M}Z_m$$ Is there something fundamentally wrong with this strategy? Please clarify if there is something wrong. On the other hand if my strategy is right then how can I verify it. Many many thanks in advance. Second Strategy: In this strategy I will fix values of all $Y_m$ and find the conditional probability and then average it over all $Y_m$'s. Obviously I will have to take the limits of at least one of the $Y_m$'s from $0-->C$. But this strategy seems to be much more difficult then the first one. Any comments on my strategies will be highly appreciated. Thanks in advance.
3- Take the $L$th power of the CDF of $T$ to find the overall probability.
Monday, 5 May 2014
probability - Where am I wrong in the following strategy?
Subscribe to:
Post Comments (Atom)
real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$
How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
Self-studying some properties of the exponential-function I came to the question of ways to assign a value to the divergent sum $$s=\sum_{k=...
-
Ok, according to some notes I have, the following is true for a random variable $X$ that can only take on positive values, i.e $P(X<0=0)$...
-
The question said: Use the Euclidean Algorithm to find gcd $(1207,569)$ and write $(1207,569)$ as an integer linear combination of $1207$ ...
No comments:
Post a Comment