Find $P(Y(x)gt E[Y(x)])$, where $Y(x)= min{i:X_igt x}$ for $(X_i)$ i.i.d.












0












$begingroup$



Let $X_i$ be i.i.d random variables with common cdf F. For a given constant x, define $Y(x)= min{i:X_igt x}$. Find $P(Y(x)gt E[Y(x)])$. What is the limit as $xtoinfty$?




My answer:
$P(Y(x)=1)=P(X_1gt x)=1-F$
$P(Y(x)=2)=P(X_1lt x,X_2gt x)=F(1-F)$
$P(Y(x)=3)=P(X_1lt x,X_2lt x,X_3gt x)=F^2(1-F)$

....
$P(Y(x)=k)=F^{k-1}(1-F)$

Thus, $E[Y(x)]=sum_{k=1}^{infty}kF^{k-1}(1-F)={1over 1-F}$
$P(Y(x)gt E[Y(x)])=P(Y(x)gt {1over 1-F})=sum_{k={*{1over 1-F}*}+1}^{infty}kF^{k-1}(1-F)$

where $*{1over 1-F}*$ denote the largest integer less than ${1over 1-F}$

Since $F=1$ when $x=infty$, $E(Y(x))=infty$, $P(Y(x)gt E[Y(x)])=0$

Please correct me if I am wrong.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Everything is fine until $$P(Y(x)gt E[Y(x)])=sum_{k=n+1}^infty kF^{k-1}(x)(1-F(x))$$ where $n$ denotes the integer part of $E(F(x))$, but after that, one simply cannot understand what you are doing. Next step: what is the value of $$sum_{k=n+1}^infty kt^{k-1}(1-t)$$ for $t$ in $(0,1)$?
    $endgroup$
    – Did
    Jan 20 at 16:45












  • $begingroup$
    I wonder if this problem is related to the secretary problem.
    $endgroup$
    – angryavian
    Jan 20 at 16:53
















0












$begingroup$



Let $X_i$ be i.i.d random variables with common cdf F. For a given constant x, define $Y(x)= min{i:X_igt x}$. Find $P(Y(x)gt E[Y(x)])$. What is the limit as $xtoinfty$?




My answer:
$P(Y(x)=1)=P(X_1gt x)=1-F$
$P(Y(x)=2)=P(X_1lt x,X_2gt x)=F(1-F)$
$P(Y(x)=3)=P(X_1lt x,X_2lt x,X_3gt x)=F^2(1-F)$

....
$P(Y(x)=k)=F^{k-1}(1-F)$

Thus, $E[Y(x)]=sum_{k=1}^{infty}kF^{k-1}(1-F)={1over 1-F}$
$P(Y(x)gt E[Y(x)])=P(Y(x)gt {1over 1-F})=sum_{k={*{1over 1-F}*}+1}^{infty}kF^{k-1}(1-F)$

where $*{1over 1-F}*$ denote the largest integer less than ${1over 1-F}$

Since $F=1$ when $x=infty$, $E(Y(x))=infty$, $P(Y(x)gt E[Y(x)])=0$

Please correct me if I am wrong.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Everything is fine until $$P(Y(x)gt E[Y(x)])=sum_{k=n+1}^infty kF^{k-1}(x)(1-F(x))$$ where $n$ denotes the integer part of $E(F(x))$, but after that, one simply cannot understand what you are doing. Next step: what is the value of $$sum_{k=n+1}^infty kt^{k-1}(1-t)$$ for $t$ in $(0,1)$?
    $endgroup$
    – Did
    Jan 20 at 16:45












  • $begingroup$
    I wonder if this problem is related to the secretary problem.
    $endgroup$
    – angryavian
    Jan 20 at 16:53














0












0








0





$begingroup$



Let $X_i$ be i.i.d random variables with common cdf F. For a given constant x, define $Y(x)= min{i:X_igt x}$. Find $P(Y(x)gt E[Y(x)])$. What is the limit as $xtoinfty$?




My answer:
$P(Y(x)=1)=P(X_1gt x)=1-F$
$P(Y(x)=2)=P(X_1lt x,X_2gt x)=F(1-F)$
$P(Y(x)=3)=P(X_1lt x,X_2lt x,X_3gt x)=F^2(1-F)$

....
$P(Y(x)=k)=F^{k-1}(1-F)$

Thus, $E[Y(x)]=sum_{k=1}^{infty}kF^{k-1}(1-F)={1over 1-F}$
$P(Y(x)gt E[Y(x)])=P(Y(x)gt {1over 1-F})=sum_{k={*{1over 1-F}*}+1}^{infty}kF^{k-1}(1-F)$

where $*{1over 1-F}*$ denote the largest integer less than ${1over 1-F}$

Since $F=1$ when $x=infty$, $E(Y(x))=infty$, $P(Y(x)gt E[Y(x)])=0$

Please correct me if I am wrong.










share|cite|improve this question











$endgroup$





Let $X_i$ be i.i.d random variables with common cdf F. For a given constant x, define $Y(x)= min{i:X_igt x}$. Find $P(Y(x)gt E[Y(x)])$. What is the limit as $xtoinfty$?




My answer:
$P(Y(x)=1)=P(X_1gt x)=1-F$
$P(Y(x)=2)=P(X_1lt x,X_2gt x)=F(1-F)$
$P(Y(x)=3)=P(X_1lt x,X_2lt x,X_3gt x)=F^2(1-F)$

....
$P(Y(x)=k)=F^{k-1}(1-F)$

Thus, $E[Y(x)]=sum_{k=1}^{infty}kF^{k-1}(1-F)={1over 1-F}$
$P(Y(x)gt E[Y(x)])=P(Y(x)gt {1over 1-F})=sum_{k={*{1over 1-F}*}+1}^{infty}kF^{k-1}(1-F)$

where $*{1over 1-F}*$ denote the largest integer less than ${1over 1-F}$

Since $F=1$ when $x=infty$, $E(Y(x))=infty$, $P(Y(x)gt E[Y(x)])=0$

Please correct me if I am wrong.







probability-theory expected-value






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 20 at 16:48









Did

248k23225463




248k23225463










asked Jan 20 at 16:32









Yibei HeYibei He

3139




3139












  • $begingroup$
    Everything is fine until $$P(Y(x)gt E[Y(x)])=sum_{k=n+1}^infty kF^{k-1}(x)(1-F(x))$$ where $n$ denotes the integer part of $E(F(x))$, but after that, one simply cannot understand what you are doing. Next step: what is the value of $$sum_{k=n+1}^infty kt^{k-1}(1-t)$$ for $t$ in $(0,1)$?
    $endgroup$
    – Did
    Jan 20 at 16:45












  • $begingroup$
    I wonder if this problem is related to the secretary problem.
    $endgroup$
    – angryavian
    Jan 20 at 16:53


















  • $begingroup$
    Everything is fine until $$P(Y(x)gt E[Y(x)])=sum_{k=n+1}^infty kF^{k-1}(x)(1-F(x))$$ where $n$ denotes the integer part of $E(F(x))$, but after that, one simply cannot understand what you are doing. Next step: what is the value of $$sum_{k=n+1}^infty kt^{k-1}(1-t)$$ for $t$ in $(0,1)$?
    $endgroup$
    – Did
    Jan 20 at 16:45












  • $begingroup$
    I wonder if this problem is related to the secretary problem.
    $endgroup$
    – angryavian
    Jan 20 at 16:53
















$begingroup$
Everything is fine until $$P(Y(x)gt E[Y(x)])=sum_{k=n+1}^infty kF^{k-1}(x)(1-F(x))$$ where $n$ denotes the integer part of $E(F(x))$, but after that, one simply cannot understand what you are doing. Next step: what is the value of $$sum_{k=n+1}^infty kt^{k-1}(1-t)$$ for $t$ in $(0,1)$?
$endgroup$
– Did
Jan 20 at 16:45






$begingroup$
Everything is fine until $$P(Y(x)gt E[Y(x)])=sum_{k=n+1}^infty kF^{k-1}(x)(1-F(x))$$ where $n$ denotes the integer part of $E(F(x))$, but after that, one simply cannot understand what you are doing. Next step: what is the value of $$sum_{k=n+1}^infty kt^{k-1}(1-t)$$ for $t$ in $(0,1)$?
$endgroup$
– Did
Jan 20 at 16:45














$begingroup$
I wonder if this problem is related to the secretary problem.
$endgroup$
– angryavian
Jan 20 at 16:53




$begingroup$
I wonder if this problem is related to the secretary problem.
$endgroup$
– angryavian
Jan 20 at 16:53










1 Answer
1






active

oldest

votes


















1












$begingroup$

$Y(x) > E[Y(x)]$ if and only if $X_i le x$ for all $i le E[Y(x)]$.
$$P(Y(x) > E[Y(x)]) = F(x)^{lfloorfrac{1}{1-F(x)}rfloor}.$$
[Your computation is close but you had a small typo. You should have $sum_{k ge lfloor frac{1}{1-F(x)}rfloor + 1} F(x)^{k-1} (1-F(x))$ which equals the above.]



Taking $x to infty$ leads to the indeterminate form $1^infty$, so you need to be more careful when taking the limit. Try taking a logarithm before applying the limit.





The logarithm can be sandwiched as
$$frac{1}{1-F(x)} log F(x) le lfloor frac{1}{1-F(x)} rfloor log F(x) le (1+frac{1}{1-F(x)}) log F(x).$$
You can show that the left-hand and right-hand sides tend to a common limit as $x to infty$ (e.g., using l'Hôpital's rule), so the middle quantity tends to this limit as well. Then exponentiate everything to conclude.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    So I got the limit of the power is -1, and the final answer will be $e^-1$. Thank you!
    $endgroup$
    – Yibei He
    Jan 20 at 20:32













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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3080785%2ffind-pyx-gt-eyx-where-yx-min-ix-i-gt-x-for-x-i-i-i-d%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









1












$begingroup$

$Y(x) > E[Y(x)]$ if and only if $X_i le x$ for all $i le E[Y(x)]$.
$$P(Y(x) > E[Y(x)]) = F(x)^{lfloorfrac{1}{1-F(x)}rfloor}.$$
[Your computation is close but you had a small typo. You should have $sum_{k ge lfloor frac{1}{1-F(x)}rfloor + 1} F(x)^{k-1} (1-F(x))$ which equals the above.]



Taking $x to infty$ leads to the indeterminate form $1^infty$, so you need to be more careful when taking the limit. Try taking a logarithm before applying the limit.





The logarithm can be sandwiched as
$$frac{1}{1-F(x)} log F(x) le lfloor frac{1}{1-F(x)} rfloor log F(x) le (1+frac{1}{1-F(x)}) log F(x).$$
You can show that the left-hand and right-hand sides tend to a common limit as $x to infty$ (e.g., using l'Hôpital's rule), so the middle quantity tends to this limit as well. Then exponentiate everything to conclude.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    So I got the limit of the power is -1, and the final answer will be $e^-1$. Thank you!
    $endgroup$
    – Yibei He
    Jan 20 at 20:32


















1












$begingroup$

$Y(x) > E[Y(x)]$ if and only if $X_i le x$ for all $i le E[Y(x)]$.
$$P(Y(x) > E[Y(x)]) = F(x)^{lfloorfrac{1}{1-F(x)}rfloor}.$$
[Your computation is close but you had a small typo. You should have $sum_{k ge lfloor frac{1}{1-F(x)}rfloor + 1} F(x)^{k-1} (1-F(x))$ which equals the above.]



Taking $x to infty$ leads to the indeterminate form $1^infty$, so you need to be more careful when taking the limit. Try taking a logarithm before applying the limit.





The logarithm can be sandwiched as
$$frac{1}{1-F(x)} log F(x) le lfloor frac{1}{1-F(x)} rfloor log F(x) le (1+frac{1}{1-F(x)}) log F(x).$$
You can show that the left-hand and right-hand sides tend to a common limit as $x to infty$ (e.g., using l'Hôpital's rule), so the middle quantity tends to this limit as well. Then exponentiate everything to conclude.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    So I got the limit of the power is -1, and the final answer will be $e^-1$. Thank you!
    $endgroup$
    – Yibei He
    Jan 20 at 20:32
















1












1








1





$begingroup$

$Y(x) > E[Y(x)]$ if and only if $X_i le x$ for all $i le E[Y(x)]$.
$$P(Y(x) > E[Y(x)]) = F(x)^{lfloorfrac{1}{1-F(x)}rfloor}.$$
[Your computation is close but you had a small typo. You should have $sum_{k ge lfloor frac{1}{1-F(x)}rfloor + 1} F(x)^{k-1} (1-F(x))$ which equals the above.]



Taking $x to infty$ leads to the indeterminate form $1^infty$, so you need to be more careful when taking the limit. Try taking a logarithm before applying the limit.





The logarithm can be sandwiched as
$$frac{1}{1-F(x)} log F(x) le lfloor frac{1}{1-F(x)} rfloor log F(x) le (1+frac{1}{1-F(x)}) log F(x).$$
You can show that the left-hand and right-hand sides tend to a common limit as $x to infty$ (e.g., using l'Hôpital's rule), so the middle quantity tends to this limit as well. Then exponentiate everything to conclude.






share|cite|improve this answer









$endgroup$



$Y(x) > E[Y(x)]$ if and only if $X_i le x$ for all $i le E[Y(x)]$.
$$P(Y(x) > E[Y(x)]) = F(x)^{lfloorfrac{1}{1-F(x)}rfloor}.$$
[Your computation is close but you had a small typo. You should have $sum_{k ge lfloor frac{1}{1-F(x)}rfloor + 1} F(x)^{k-1} (1-F(x))$ which equals the above.]



Taking $x to infty$ leads to the indeterminate form $1^infty$, so you need to be more careful when taking the limit. Try taking a logarithm before applying the limit.





The logarithm can be sandwiched as
$$frac{1}{1-F(x)} log F(x) le lfloor frac{1}{1-F(x)} rfloor log F(x) le (1+frac{1}{1-F(x)}) log F(x).$$
You can show that the left-hand and right-hand sides tend to a common limit as $x to infty$ (e.g., using l'Hôpital's rule), so the middle quantity tends to this limit as well. Then exponentiate everything to conclude.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Jan 20 at 16:46









angryavianangryavian

41.9k23381




41.9k23381












  • $begingroup$
    So I got the limit of the power is -1, and the final answer will be $e^-1$. Thank you!
    $endgroup$
    – Yibei He
    Jan 20 at 20:32




















  • $begingroup$
    So I got the limit of the power is -1, and the final answer will be $e^-1$. Thank you!
    $endgroup$
    – Yibei He
    Jan 20 at 20:32


















$begingroup$
So I got the limit of the power is -1, and the final answer will be $e^-1$. Thank you!
$endgroup$
– Yibei He
Jan 20 at 20:32






$begingroup$
So I got the limit of the power is -1, and the final answer will be $e^-1$. Thank you!
$endgroup$
– Yibei He
Jan 20 at 20:32




















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3080785%2ffind-pyx-gt-eyx-where-yx-min-ix-i-gt-x-for-x-i-i-i-d%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

MongoDB - Not Authorized To Execute Command

How to fix TextFormField cause rebuild widget in Flutter

in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith