Is $leftlbrace 1 - Fleft( x_n right)^n rightrbrace_n$ increasing when $x_n$ is a fixed point of the Mills ratio? The Next CEO of Stack OverflowIs $left(X_1,… ,X_n,barXright)$ jointly normal distributed if $left(X_1,… ,X_nright)$ is?For $(x_n)$ increasing, $sum_n=1^inftyleft(1-fracx_nx_n+1right)$ if $(x_n)$ is bounded and diverges if it is unboundedMonotonicity of the sequences $left(1+frac1nright)^n$, $left(1-frac1nright)^n$ and $left(1+frac1nright)^n+1$On expectation of maximum of gaussiansProve that the sequence $x_n+1=frac12left(x_n+frac1x_nright)$ is not increasingEmpirical CDF of a sequence?Find conditional density $fleft(x_1,cdots,x_nmid x_(n)right)$Show $Eleft[fracX_1+X_2+cdots+X_kX_1+X_2+cdots+X_nright]=frackn$The CDF of the maximum of some function of the maximum two order statisticsmaximum of uniform (continuous) random variables
Why did the Drakh emissary look so blurred in S04:E11 "Lines of Communication"?
Incomplete cube
Can I cast Thunderwave and be at the center of its bottom face, but not be affected by it?
Car headlights in a world without electricity
How dangerous is XSS
How seriously should I take size and weight limits of hand luggage?
How can a day be of 24 hours?
Could you use a laser beam as a modulated carrier wave for radio signal?
Find the majority element, which appears more than half the time
How exploitable/balanced is this homebrew spell: Spell Permanency?
Can you teleport closer to a creature you are Frightened of?
Is it okay to majorly distort historical facts while writing a fiction story?
"Eavesdropping" vs "Listen in on"
What is the difference between 'contrib' and 'non-free' packages repositories?
Small nick on power cord from an electric alarm clock, and copper wiring exposed but intact
Is a linearly independent set whose span is dense a Schauder basis?
How badly should I try to prevent a user from XSSing themselves?
Planeswalker Ability and Death Timing
Do I need to write [sic] when including a quotation with a number less than 10 that isn't written out?
Physiological effects of huge anime eyes
Is a distribution that is normal, but highly skewed, considered Gaussian?
Why did early computer designers eschew integers?
Ising model simulation
How can I replace x-axis labels with pre-determined symbols?
Is $leftlbrace 1 - Fleft( x_n right)^n rightrbrace_n$ increasing when $x_n$ is a fixed point of the Mills ratio?
The Next CEO of Stack OverflowIs $left(X_1,… ,X_n,barXright)$ jointly normal distributed if $left(X_1,… ,X_nright)$ is?For $(x_n)$ increasing, $sum_n=1^inftyleft(1-fracx_nx_n+1right)$ if $(x_n)$ is bounded and diverges if it is unboundedMonotonicity of the sequences $left(1+frac1nright)^n$, $left(1-frac1nright)^n$ and $left(1+frac1nright)^n+1$On expectation of maximum of gaussiansProve that the sequence $x_n+1=frac12left(x_n+frac1x_nright)$ is not increasingEmpirical CDF of a sequence?Find conditional density $fleft(x_1,cdots,x_nmid x_(n)right)$Show $Eleft[fracX_1+X_2+cdots+X_kX_1+X_2+cdots+X_nright]=frackn$The CDF of the maximum of some function of the maximum two order statisticsmaximum of uniform (continuous) random variables
$begingroup$
Let $X_1, ..., X_n$ be $n$ i.i.d. Let let $f$ be their log-concave PDF and $F$ be their CDF.
The nth order statistic $max_i=1...n X_i$ has for CDF $F_nleft(xright) = mathbbPleft( max_i=1...N X_i < x right) = Fleft( x right)^n$ and its PDF is $f_nleft(xright) = n fleft(xright) Fleft(xright)^n-1$
I am interested in the growth of $leftlbrace 1 - Fleft( x_n right)^n rightrbrace_n$ when the number of variables $n$ increases. Here, $x_n = frac1 - Fleft( x_n right)^nf_nleft( x_n right)$. Note that $x_n$ is the fixed point of the Mills ratio of $max_i=1...n X_i$.
I have run some simulations and it seems that $1 - Fleft( x_n+1 right)^n+1 > 1 - Fleft( x_n right)^n$ but I have failed to prove it.
Is $leftlbrace 1 - Fleft( x_n right)^n rightrbrace_n$ really increasing?
$f$ being log-concave, there are properties I have tried to exploit without success:
$f_n$ and $F_n$ are log concave
$frac1 - Fleft( x right)^nf_nleft( x right)$ is decreasing in $x$
$fracf_nleft( x right)Fleft( x right)^n$ is decreaing in $x$
$x_n$ is the unique fixed point of
$frac1 - Fleft( x right)^nf_nleft( x right)$ because $frac1 - Fleft( x right)^nf_nleft( x right)$ is strictly decreasing
$leftlbrace x_n rightrbrace_n$ is increasing
Finally, if the $X_1, ..., X_n$ are uniformly distributed, $1 - Fleft( x_n right)^n$ is increasing and has an explicit form.
probability sequences-and-series order-statistics
New contributor
$endgroup$
add a comment |
$begingroup$
Let $X_1, ..., X_n$ be $n$ i.i.d. Let let $f$ be their log-concave PDF and $F$ be their CDF.
The nth order statistic $max_i=1...n X_i$ has for CDF $F_nleft(xright) = mathbbPleft( max_i=1...N X_i < x right) = Fleft( x right)^n$ and its PDF is $f_nleft(xright) = n fleft(xright) Fleft(xright)^n-1$
I am interested in the growth of $leftlbrace 1 - Fleft( x_n right)^n rightrbrace_n$ when the number of variables $n$ increases. Here, $x_n = frac1 - Fleft( x_n right)^nf_nleft( x_n right)$. Note that $x_n$ is the fixed point of the Mills ratio of $max_i=1...n X_i$.
I have run some simulations and it seems that $1 - Fleft( x_n+1 right)^n+1 > 1 - Fleft( x_n right)^n$ but I have failed to prove it.
Is $leftlbrace 1 - Fleft( x_n right)^n rightrbrace_n$ really increasing?
$f$ being log-concave, there are properties I have tried to exploit without success:
$f_n$ and $F_n$ are log concave
$frac1 - Fleft( x right)^nf_nleft( x right)$ is decreasing in $x$
$fracf_nleft( x right)Fleft( x right)^n$ is decreaing in $x$
$x_n$ is the unique fixed point of
$frac1 - Fleft( x right)^nf_nleft( x right)$ because $frac1 - Fleft( x right)^nf_nleft( x right)$ is strictly decreasing
$leftlbrace x_n rightrbrace_n$ is increasing
Finally, if the $X_1, ..., X_n$ are uniformly distributed, $1 - Fleft( x_n right)^n$ is increasing and has an explicit form.
probability sequences-and-series order-statistics
New contributor
$endgroup$
add a comment |
$begingroup$
Let $X_1, ..., X_n$ be $n$ i.i.d. Let let $f$ be their log-concave PDF and $F$ be their CDF.
The nth order statistic $max_i=1...n X_i$ has for CDF $F_nleft(xright) = mathbbPleft( max_i=1...N X_i < x right) = Fleft( x right)^n$ and its PDF is $f_nleft(xright) = n fleft(xright) Fleft(xright)^n-1$
I am interested in the growth of $leftlbrace 1 - Fleft( x_n right)^n rightrbrace_n$ when the number of variables $n$ increases. Here, $x_n = frac1 - Fleft( x_n right)^nf_nleft( x_n right)$. Note that $x_n$ is the fixed point of the Mills ratio of $max_i=1...n X_i$.
I have run some simulations and it seems that $1 - Fleft( x_n+1 right)^n+1 > 1 - Fleft( x_n right)^n$ but I have failed to prove it.
Is $leftlbrace 1 - Fleft( x_n right)^n rightrbrace_n$ really increasing?
$f$ being log-concave, there are properties I have tried to exploit without success:
$f_n$ and $F_n$ are log concave
$frac1 - Fleft( x right)^nf_nleft( x right)$ is decreasing in $x$
$fracf_nleft( x right)Fleft( x right)^n$ is decreaing in $x$
$x_n$ is the unique fixed point of
$frac1 - Fleft( x right)^nf_nleft( x right)$ because $frac1 - Fleft( x right)^nf_nleft( x right)$ is strictly decreasing
$leftlbrace x_n rightrbrace_n$ is increasing
Finally, if the $X_1, ..., X_n$ are uniformly distributed, $1 - Fleft( x_n right)^n$ is increasing and has an explicit form.
probability sequences-and-series order-statistics
New contributor
$endgroup$
Let $X_1, ..., X_n$ be $n$ i.i.d. Let let $f$ be their log-concave PDF and $F$ be their CDF.
The nth order statistic $max_i=1...n X_i$ has for CDF $F_nleft(xright) = mathbbPleft( max_i=1...N X_i < x right) = Fleft( x right)^n$ and its PDF is $f_nleft(xright) = n fleft(xright) Fleft(xright)^n-1$
I am interested in the growth of $leftlbrace 1 - Fleft( x_n right)^n rightrbrace_n$ when the number of variables $n$ increases. Here, $x_n = frac1 - Fleft( x_n right)^nf_nleft( x_n right)$. Note that $x_n$ is the fixed point of the Mills ratio of $max_i=1...n X_i$.
I have run some simulations and it seems that $1 - Fleft( x_n+1 right)^n+1 > 1 - Fleft( x_n right)^n$ but I have failed to prove it.
Is $leftlbrace 1 - Fleft( x_n right)^n rightrbrace_n$ really increasing?
$f$ being log-concave, there are properties I have tried to exploit without success:
$f_n$ and $F_n$ are log concave
$frac1 - Fleft( x right)^nf_nleft( x right)$ is decreasing in $x$
$fracf_nleft( x right)Fleft( x right)^n$ is decreaing in $x$
$x_n$ is the unique fixed point of
$frac1 - Fleft( x right)^nf_nleft( x right)$ because $frac1 - Fleft( x right)^nf_nleft( x right)$ is strictly decreasing
$leftlbrace x_n rightrbrace_n$ is increasing
Finally, if the $X_1, ..., X_n$ are uniformly distributed, $1 - Fleft( x_n right)^n$ is increasing and has an explicit form.
probability sequences-and-series order-statistics
probability sequences-and-series order-statistics
New contributor
New contributor
New contributor
asked Mar 28 at 10:40
KuwiKuwi
61
61
New contributor
New contributor
add a comment |
add a comment |
0
active
oldest
votes
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
);
);
Kuwi is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3165727%2fis-left-lbrace-1-f-left-x-n-rightn-right-rbrace-n-increasing-when-x-n%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Kuwi is a new contributor. Be nice, and check out our Code of Conduct.
Kuwi is a new contributor. Be nice, and check out our Code of Conduct.
Kuwi is a new contributor. Be nice, and check out our Code of Conduct.
Kuwi is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3165727%2fis-left-lbrace-1-f-left-x-n-rightn-right-rbrace-n-increasing-when-x-n%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