MHB Calculate Probability: Diff $Y-X \leq 1$

  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    Probability
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! (Wave)

Suppose that $X$ has the uniform distribution on the interval $[0,2]$ and $Y$ has the uniform distribution on the interval $[2,4]$. If $X,Y$ are independent, I want to find the probability that the difference $Y-X$ is $\leq 1$.

I have thought the following.The density function of $X$ is

$$p_1(x)=\left\{\begin{matrix}
\frac{1}{2} &, 0 \leq x \leq 2 \\
0 & , \text{ otherwise}
\end{matrix}\right.$$

while the density function of $Y$ is

$$p_2(x)=\left\{\begin{matrix}
\frac{1}{2} &, 2 \leq x \leq 4 \\
0 & , \text{ otherwise}
\end{matrix}\right.$$How can we find the probability that the difference $Y-X$ is $\leq 1$ ? Do we use the above density functions? (Thinking)
 
Physics news on Phys.org
Hey evinda! (Smile)

Yep, we use those density functions.

$X$ and $Y$ have a so called joint probability distribution $f_{X,Y}(x,y)$.
If means that:
$$P(Y-X\le 1) = \iint_{y-x\le 1} f_{X,Y}(x,y)\,dx\,dy$$
And since they are independent, we have:
$$f_{X,Y}(x,y) = f_X(x)f_Y(y) = p_1(x)p_2(y)$$
(Thinking)
 
Just for fun, here's the corresponding graph.
[DESMOS]advanced: {"version":5,"graph":{"squareAxes":false,"viewport":{"xmin":-0.5,"ymin":-0.5,"xmax":6.5,"ymax":6.5}},"expressions":{"list":[{"id":"graph1","type":"expression","latex":"\\max\\left(\\left|x-1\\right|,\\left|y-3\\right|\\right)\\le1","color":"#60a0e3"},{"id":"2","type":"expression","latex":"y-x\\le1\\left\\{\\max\\left(\\left|x-1\\right|,\\left|y-3\\right|\\right)\\le1\\right\\}","color":"#c74440"},{"id":"3","type":"expression","color":"#fa7e19"}]}}[/DESMOS]

The blue area corresponds to the part where the joint probability density is non-zero.
And the red area corresponds to the part where $Y-X \le 1$. (Thinking)
 
Nice, thank you! (Smirk)
 
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