Imagine $X_1$,…,$X_n$ are iid uniformly distributed and $X=max(a_1X_1,..,a_nX_n)$,...
$begingroup$
Imagine $X_1$,...,$X_n$ are i.i.d. uniformly distributed on the interval [0,1] and $X=max(a_1X_1,..,a_nX_n)$ and $Y=max(b_1X_1,..,b_nX_n)$ for some constants $a_1,...,a_n$, $b_1,...,b_n$.(All real, positive numbers)
What is the joint pdf (or cdf) of X and Y?
My idea: We have $f_{X,Y}(x,y)=f_{Xmid Y}(x)f_Y(y)$, Now the latter term can be calculated very easily because we have $F_Y(x)=prod_{i=1}^n F_{b_iX_i}(x)$. So now we need to calculate the conditional probability;
However, I do not know how to continue here;
Any idea?
probability probability-distributions
$endgroup$
add a comment |
$begingroup$
Imagine $X_1$,...,$X_n$ are i.i.d. uniformly distributed on the interval [0,1] and $X=max(a_1X_1,..,a_nX_n)$ and $Y=max(b_1X_1,..,b_nX_n)$ for some constants $a_1,...,a_n$, $b_1,...,b_n$.(All real, positive numbers)
What is the joint pdf (or cdf) of X and Y?
My idea: We have $f_{X,Y}(x,y)=f_{Xmid Y}(x)f_Y(y)$, Now the latter term can be calculated very easily because we have $F_Y(x)=prod_{i=1}^n F_{b_iX_i}(x)$. So now we need to calculate the conditional probability;
However, I do not know how to continue here;
Any idea?
probability probability-distributions
$endgroup$
add a comment |
$begingroup$
Imagine $X_1$,...,$X_n$ are i.i.d. uniformly distributed on the interval [0,1] and $X=max(a_1X_1,..,a_nX_n)$ and $Y=max(b_1X_1,..,b_nX_n)$ for some constants $a_1,...,a_n$, $b_1,...,b_n$.(All real, positive numbers)
What is the joint pdf (or cdf) of X and Y?
My idea: We have $f_{X,Y}(x,y)=f_{Xmid Y}(x)f_Y(y)$, Now the latter term can be calculated very easily because we have $F_Y(x)=prod_{i=1}^n F_{b_iX_i}(x)$. So now we need to calculate the conditional probability;
However, I do not know how to continue here;
Any idea?
probability probability-distributions
$endgroup$
Imagine $X_1$,...,$X_n$ are i.i.d. uniformly distributed on the interval [0,1] and $X=max(a_1X_1,..,a_nX_n)$ and $Y=max(b_1X_1,..,b_nX_n)$ for some constants $a_1,...,a_n$, $b_1,...,b_n$.(All real, positive numbers)
What is the joint pdf (or cdf) of X and Y?
My idea: We have $f_{X,Y}(x,y)=f_{Xmid Y}(x)f_Y(y)$, Now the latter term can be calculated very easily because we have $F_Y(x)=prod_{i=1}^n F_{b_iX_i}(x)$. So now we need to calculate the conditional probability;
However, I do not know how to continue here;
Any idea?
probability probability-distributions
probability probability-distributions
edited Nov 29 '18 at 9:24
J.Doe
asked Nov 29 '18 at 9:16
J.DoeJ.Doe
19910
19910
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
We have $$Pr(X<x,Y<y){=Pr(max(a_1X_1,..,a_nX_n)<x,max(b_1X_1,..,b_nX_n)<y)\=Pr(a_1X_1,..,a_nX_n<x,b_1X_1,..,b_nX_n<y)\=Pr(X_1<min{{xover a_1},{yover b_1}},cdots , X_n<min{{xover a_n},{yover b_n}})\=U(min{{xover a_1},{yover b_1}})cdots U(min{{xover a_n},{yover b_n}})}$$where $U(x)$ is the cmf of uniform distribution on $[0,1]$. It is not generally easy to find the pmf from the above cmf by differentiation. It is all I got for now!
$endgroup$
$begingroup$
Thank you very much; Ill try to work with it - maybe I can work only with the cdf instead of the pdf;
$endgroup$
– J.Doe
Nov 29 '18 at 10:03
$begingroup$
But if you have an idea how to get to the pdf let me know
$endgroup$
– J.Doe
Nov 29 '18 at 10:04
$begingroup$
You're welcome. If you felt more details i'll try to make some calculations but the results are easy to be derived only for some particular cases :)
$endgroup$
– Mostafa Ayaz
Nov 29 '18 at 10:04
$begingroup$
Actually you must divide each $min{{xover a_i},{yover b_i}}$ to the sections where $0<{xover a_i}<1$ or $0<{yover b_i}<1$. Also notice that the cdf is nonzero only if $0<min{{xover a_i},{yover b_i}}<1$ for all $i$
$endgroup$
– Mostafa Ayaz
Nov 29 '18 at 10:06
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3018392%2fimagine-x-1-x-n-are-iid-uniformly-distributed-and-x-maxa-1x-1-a-nx%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
We have $$Pr(X<x,Y<y){=Pr(max(a_1X_1,..,a_nX_n)<x,max(b_1X_1,..,b_nX_n)<y)\=Pr(a_1X_1,..,a_nX_n<x,b_1X_1,..,b_nX_n<y)\=Pr(X_1<min{{xover a_1},{yover b_1}},cdots , X_n<min{{xover a_n},{yover b_n}})\=U(min{{xover a_1},{yover b_1}})cdots U(min{{xover a_n},{yover b_n}})}$$where $U(x)$ is the cmf of uniform distribution on $[0,1]$. It is not generally easy to find the pmf from the above cmf by differentiation. It is all I got for now!
$endgroup$
$begingroup$
Thank you very much; Ill try to work with it - maybe I can work only with the cdf instead of the pdf;
$endgroup$
– J.Doe
Nov 29 '18 at 10:03
$begingroup$
But if you have an idea how to get to the pdf let me know
$endgroup$
– J.Doe
Nov 29 '18 at 10:04
$begingroup$
You're welcome. If you felt more details i'll try to make some calculations but the results are easy to be derived only for some particular cases :)
$endgroup$
– Mostafa Ayaz
Nov 29 '18 at 10:04
$begingroup$
Actually you must divide each $min{{xover a_i},{yover b_i}}$ to the sections where $0<{xover a_i}<1$ or $0<{yover b_i}<1$. Also notice that the cdf is nonzero only if $0<min{{xover a_i},{yover b_i}}<1$ for all $i$
$endgroup$
– Mostafa Ayaz
Nov 29 '18 at 10:06
add a comment |
$begingroup$
We have $$Pr(X<x,Y<y){=Pr(max(a_1X_1,..,a_nX_n)<x,max(b_1X_1,..,b_nX_n)<y)\=Pr(a_1X_1,..,a_nX_n<x,b_1X_1,..,b_nX_n<y)\=Pr(X_1<min{{xover a_1},{yover b_1}},cdots , X_n<min{{xover a_n},{yover b_n}})\=U(min{{xover a_1},{yover b_1}})cdots U(min{{xover a_n},{yover b_n}})}$$where $U(x)$ is the cmf of uniform distribution on $[0,1]$. It is not generally easy to find the pmf from the above cmf by differentiation. It is all I got for now!
$endgroup$
$begingroup$
Thank you very much; Ill try to work with it - maybe I can work only with the cdf instead of the pdf;
$endgroup$
– J.Doe
Nov 29 '18 at 10:03
$begingroup$
But if you have an idea how to get to the pdf let me know
$endgroup$
– J.Doe
Nov 29 '18 at 10:04
$begingroup$
You're welcome. If you felt more details i'll try to make some calculations but the results are easy to be derived only for some particular cases :)
$endgroup$
– Mostafa Ayaz
Nov 29 '18 at 10:04
$begingroup$
Actually you must divide each $min{{xover a_i},{yover b_i}}$ to the sections where $0<{xover a_i}<1$ or $0<{yover b_i}<1$. Also notice that the cdf is nonzero only if $0<min{{xover a_i},{yover b_i}}<1$ for all $i$
$endgroup$
– Mostafa Ayaz
Nov 29 '18 at 10:06
add a comment |
$begingroup$
We have $$Pr(X<x,Y<y){=Pr(max(a_1X_1,..,a_nX_n)<x,max(b_1X_1,..,b_nX_n)<y)\=Pr(a_1X_1,..,a_nX_n<x,b_1X_1,..,b_nX_n<y)\=Pr(X_1<min{{xover a_1},{yover b_1}},cdots , X_n<min{{xover a_n},{yover b_n}})\=U(min{{xover a_1},{yover b_1}})cdots U(min{{xover a_n},{yover b_n}})}$$where $U(x)$ is the cmf of uniform distribution on $[0,1]$. It is not generally easy to find the pmf from the above cmf by differentiation. It is all I got for now!
$endgroup$
We have $$Pr(X<x,Y<y){=Pr(max(a_1X_1,..,a_nX_n)<x,max(b_1X_1,..,b_nX_n)<y)\=Pr(a_1X_1,..,a_nX_n<x,b_1X_1,..,b_nX_n<y)\=Pr(X_1<min{{xover a_1},{yover b_1}},cdots , X_n<min{{xover a_n},{yover b_n}})\=U(min{{xover a_1},{yover b_1}})cdots U(min{{xover a_n},{yover b_n}})}$$where $U(x)$ is the cmf of uniform distribution on $[0,1]$. It is not generally easy to find the pmf from the above cmf by differentiation. It is all I got for now!
answered Nov 29 '18 at 9:47
Mostafa AyazMostafa Ayaz
15.5k3939
15.5k3939
$begingroup$
Thank you very much; Ill try to work with it - maybe I can work only with the cdf instead of the pdf;
$endgroup$
– J.Doe
Nov 29 '18 at 10:03
$begingroup$
But if you have an idea how to get to the pdf let me know
$endgroup$
– J.Doe
Nov 29 '18 at 10:04
$begingroup$
You're welcome. If you felt more details i'll try to make some calculations but the results are easy to be derived only for some particular cases :)
$endgroup$
– Mostafa Ayaz
Nov 29 '18 at 10:04
$begingroup$
Actually you must divide each $min{{xover a_i},{yover b_i}}$ to the sections where $0<{xover a_i}<1$ or $0<{yover b_i}<1$. Also notice that the cdf is nonzero only if $0<min{{xover a_i},{yover b_i}}<1$ for all $i$
$endgroup$
– Mostafa Ayaz
Nov 29 '18 at 10:06
add a comment |
$begingroup$
Thank you very much; Ill try to work with it - maybe I can work only with the cdf instead of the pdf;
$endgroup$
– J.Doe
Nov 29 '18 at 10:03
$begingroup$
But if you have an idea how to get to the pdf let me know
$endgroup$
– J.Doe
Nov 29 '18 at 10:04
$begingroup$
You're welcome. If you felt more details i'll try to make some calculations but the results are easy to be derived only for some particular cases :)
$endgroup$
– Mostafa Ayaz
Nov 29 '18 at 10:04
$begingroup$
Actually you must divide each $min{{xover a_i},{yover b_i}}$ to the sections where $0<{xover a_i}<1$ or $0<{yover b_i}<1$. Also notice that the cdf is nonzero only if $0<min{{xover a_i},{yover b_i}}<1$ for all $i$
$endgroup$
– Mostafa Ayaz
Nov 29 '18 at 10:06
$begingroup$
Thank you very much; Ill try to work with it - maybe I can work only with the cdf instead of the pdf;
$endgroup$
– J.Doe
Nov 29 '18 at 10:03
$begingroup$
Thank you very much; Ill try to work with it - maybe I can work only with the cdf instead of the pdf;
$endgroup$
– J.Doe
Nov 29 '18 at 10:03
$begingroup$
But if you have an idea how to get to the pdf let me know
$endgroup$
– J.Doe
Nov 29 '18 at 10:04
$begingroup$
But if you have an idea how to get to the pdf let me know
$endgroup$
– J.Doe
Nov 29 '18 at 10:04
$begingroup$
You're welcome. If you felt more details i'll try to make some calculations but the results are easy to be derived only for some particular cases :)
$endgroup$
– Mostafa Ayaz
Nov 29 '18 at 10:04
$begingroup$
You're welcome. If you felt more details i'll try to make some calculations but the results are easy to be derived only for some particular cases :)
$endgroup$
– Mostafa Ayaz
Nov 29 '18 at 10:04
$begingroup$
Actually you must divide each $min{{xover a_i},{yover b_i}}$ to the sections where $0<{xover a_i}<1$ or $0<{yover b_i}<1$. Also notice that the cdf is nonzero only if $0<min{{xover a_i},{yover b_i}}<1$ for all $i$
$endgroup$
– Mostafa Ayaz
Nov 29 '18 at 10:06
$begingroup$
Actually you must divide each $min{{xover a_i},{yover b_i}}$ to the sections where $0<{xover a_i}<1$ or $0<{yover b_i}<1$. Also notice that the cdf is nonzero only if $0<min{{xover a_i},{yover b_i}}<1$ for all $i$
$endgroup$
– Mostafa Ayaz
Nov 29 '18 at 10:06
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3018392%2fimagine-x-1-x-n-are-iid-uniformly-distributed-and-x-maxa-1x-1-a-nx%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown