Upper bound for the probability of violating a set of conditions
$begingroup$
Let $X_1,ldots,X_n$ be independent and normally distributed $mathcal{N}(bar{x},sigma^2)$ random variables. Let $g:{rm R} to [0,bar{g}]$ be a decreasing bounded function. Let $a$, $lambda$ and $l_{i,j}$ be positive constants, with $sum_j l_{i,j}=1$ for all $i$. Let $x^{ast}$ denote the unique solution to
begin{align}
x^{ast}-{rm E}[X_i , | , X_i <x^{ast}]-lambda g(x^{ast})=0
end{align}
Consider the set of conditions:
begin{align}
sum_{j=1}^n textbf{1}_{X_j in (-infty,x^{ast})}l_{i,j}{rm E}[X_j , | , X_j <x^{ast}] + sum_{j=1}^n textbf{1}_{X_j in [x^{ast},+infty)}l_{i,j}X_j -sum_{j=1}^n textbf{1}_{X_j in [x^{ast},+infty)}(l_{i,j-1}+l_{i,j+1})g(X_j) - X_i-textbf{1}_{X_{i-1} in [x^{ast},+infty)}g(X_{i-1})-textbf{1}_{X_{i+1} in [x^{ast},+infty)}g(X_{i+1})geq -a qquad i =1,ldots,n
end{align}
Can someone find an upper bound that does not depend on $x^{ast}$ for the probability that the set of conditions above does not hold (i.e., that at least one of the inequalities does not hold)?
EDIT: If I could show that
begin{align}
sum_{j=1}^n textbf{1}_{X_j in (-infty,x^{ast})}l_{i,j}{rm E}[X_j , | , X_j <x^{ast}] + sum_{j=1}^n textbf{1}_{X_j in [x^{ast},+infty)}l_{i,j}X_j end{align}
is concave in $x^{ast}$, or if I could impose that in terms of the primitives, then I would be able to find that upper bound. For instance, if the above expression is concave, then I can find an upper bound for the probability that the inequality does not hold for $i$ given by
begin{align}
maxleft{1-Phileft(dfrac{a-2bar{g}}{sigmaleft[sum_{jneq i}l_{i,j}^2+left(1-l_{i,i}right)^2right]^{frac{1}{2}}}right),,,1-Phileft(dfrac{a}{sigma}right)right}
end{align}
where $Phi$ is the standard normal CDF.
Can anyone show that the above expression is concave in $x^{ast}$, or can anyone impose concavity in terms of the primitives?
probability normal-distribution conditional-probability upper-lower-bounds
$endgroup$
add a comment |
$begingroup$
Let $X_1,ldots,X_n$ be independent and normally distributed $mathcal{N}(bar{x},sigma^2)$ random variables. Let $g:{rm R} to [0,bar{g}]$ be a decreasing bounded function. Let $a$, $lambda$ and $l_{i,j}$ be positive constants, with $sum_j l_{i,j}=1$ for all $i$. Let $x^{ast}$ denote the unique solution to
begin{align}
x^{ast}-{rm E}[X_i , | , X_i <x^{ast}]-lambda g(x^{ast})=0
end{align}
Consider the set of conditions:
begin{align}
sum_{j=1}^n textbf{1}_{X_j in (-infty,x^{ast})}l_{i,j}{rm E}[X_j , | , X_j <x^{ast}] + sum_{j=1}^n textbf{1}_{X_j in [x^{ast},+infty)}l_{i,j}X_j -sum_{j=1}^n textbf{1}_{X_j in [x^{ast},+infty)}(l_{i,j-1}+l_{i,j+1})g(X_j) - X_i-textbf{1}_{X_{i-1} in [x^{ast},+infty)}g(X_{i-1})-textbf{1}_{X_{i+1} in [x^{ast},+infty)}g(X_{i+1})geq -a qquad i =1,ldots,n
end{align}
Can someone find an upper bound that does not depend on $x^{ast}$ for the probability that the set of conditions above does not hold (i.e., that at least one of the inequalities does not hold)?
EDIT: If I could show that
begin{align}
sum_{j=1}^n textbf{1}_{X_j in (-infty,x^{ast})}l_{i,j}{rm E}[X_j , | , X_j <x^{ast}] + sum_{j=1}^n textbf{1}_{X_j in [x^{ast},+infty)}l_{i,j}X_j end{align}
is concave in $x^{ast}$, or if I could impose that in terms of the primitives, then I would be able to find that upper bound. For instance, if the above expression is concave, then I can find an upper bound for the probability that the inequality does not hold for $i$ given by
begin{align}
maxleft{1-Phileft(dfrac{a-2bar{g}}{sigmaleft[sum_{jneq i}l_{i,j}^2+left(1-l_{i,i}right)^2right]^{frac{1}{2}}}right),,,1-Phileft(dfrac{a}{sigma}right)right}
end{align}
where $Phi$ is the standard normal CDF.
Can anyone show that the above expression is concave in $x^{ast}$, or can anyone impose concavity in terms of the primitives?
probability normal-distribution conditional-probability upper-lower-bounds
$endgroup$
add a comment |
$begingroup$
Let $X_1,ldots,X_n$ be independent and normally distributed $mathcal{N}(bar{x},sigma^2)$ random variables. Let $g:{rm R} to [0,bar{g}]$ be a decreasing bounded function. Let $a$, $lambda$ and $l_{i,j}$ be positive constants, with $sum_j l_{i,j}=1$ for all $i$. Let $x^{ast}$ denote the unique solution to
begin{align}
x^{ast}-{rm E}[X_i , | , X_i <x^{ast}]-lambda g(x^{ast})=0
end{align}
Consider the set of conditions:
begin{align}
sum_{j=1}^n textbf{1}_{X_j in (-infty,x^{ast})}l_{i,j}{rm E}[X_j , | , X_j <x^{ast}] + sum_{j=1}^n textbf{1}_{X_j in [x^{ast},+infty)}l_{i,j}X_j -sum_{j=1}^n textbf{1}_{X_j in [x^{ast},+infty)}(l_{i,j-1}+l_{i,j+1})g(X_j) - X_i-textbf{1}_{X_{i-1} in [x^{ast},+infty)}g(X_{i-1})-textbf{1}_{X_{i+1} in [x^{ast},+infty)}g(X_{i+1})geq -a qquad i =1,ldots,n
end{align}
Can someone find an upper bound that does not depend on $x^{ast}$ for the probability that the set of conditions above does not hold (i.e., that at least one of the inequalities does not hold)?
EDIT: If I could show that
begin{align}
sum_{j=1}^n textbf{1}_{X_j in (-infty,x^{ast})}l_{i,j}{rm E}[X_j , | , X_j <x^{ast}] + sum_{j=1}^n textbf{1}_{X_j in [x^{ast},+infty)}l_{i,j}X_j end{align}
is concave in $x^{ast}$, or if I could impose that in terms of the primitives, then I would be able to find that upper bound. For instance, if the above expression is concave, then I can find an upper bound for the probability that the inequality does not hold for $i$ given by
begin{align}
maxleft{1-Phileft(dfrac{a-2bar{g}}{sigmaleft[sum_{jneq i}l_{i,j}^2+left(1-l_{i,i}right)^2right]^{frac{1}{2}}}right),,,1-Phileft(dfrac{a}{sigma}right)right}
end{align}
where $Phi$ is the standard normal CDF.
Can anyone show that the above expression is concave in $x^{ast}$, or can anyone impose concavity in terms of the primitives?
probability normal-distribution conditional-probability upper-lower-bounds
$endgroup$
Let $X_1,ldots,X_n$ be independent and normally distributed $mathcal{N}(bar{x},sigma^2)$ random variables. Let $g:{rm R} to [0,bar{g}]$ be a decreasing bounded function. Let $a$, $lambda$ and $l_{i,j}$ be positive constants, with $sum_j l_{i,j}=1$ for all $i$. Let $x^{ast}$ denote the unique solution to
begin{align}
x^{ast}-{rm E}[X_i , | , X_i <x^{ast}]-lambda g(x^{ast})=0
end{align}
Consider the set of conditions:
begin{align}
sum_{j=1}^n textbf{1}_{X_j in (-infty,x^{ast})}l_{i,j}{rm E}[X_j , | , X_j <x^{ast}] + sum_{j=1}^n textbf{1}_{X_j in [x^{ast},+infty)}l_{i,j}X_j -sum_{j=1}^n textbf{1}_{X_j in [x^{ast},+infty)}(l_{i,j-1}+l_{i,j+1})g(X_j) - X_i-textbf{1}_{X_{i-1} in [x^{ast},+infty)}g(X_{i-1})-textbf{1}_{X_{i+1} in [x^{ast},+infty)}g(X_{i+1})geq -a qquad i =1,ldots,n
end{align}
Can someone find an upper bound that does not depend on $x^{ast}$ for the probability that the set of conditions above does not hold (i.e., that at least one of the inequalities does not hold)?
EDIT: If I could show that
begin{align}
sum_{j=1}^n textbf{1}_{X_j in (-infty,x^{ast})}l_{i,j}{rm E}[X_j , | , X_j <x^{ast}] + sum_{j=1}^n textbf{1}_{X_j in [x^{ast},+infty)}l_{i,j}X_j end{align}
is concave in $x^{ast}$, or if I could impose that in terms of the primitives, then I would be able to find that upper bound. For instance, if the above expression is concave, then I can find an upper bound for the probability that the inequality does not hold for $i$ given by
begin{align}
maxleft{1-Phileft(dfrac{a-2bar{g}}{sigmaleft[sum_{jneq i}l_{i,j}^2+left(1-l_{i,i}right)^2right]^{frac{1}{2}}}right),,,1-Phileft(dfrac{a}{sigma}right)right}
end{align}
where $Phi$ is the standard normal CDF.
Can anyone show that the above expression is concave in $x^{ast}$, or can anyone impose concavity in terms of the primitives?
probability normal-distribution conditional-probability upper-lower-bounds
probability normal-distribution conditional-probability upper-lower-bounds
edited Dec 16 '18 at 17:04
capadocia
asked Dec 15 '18 at 21:52
capadociacapadocia
499
499
add a comment |
add a comment |
0
active
oldest
votes
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%2f3041999%2fupper-bound-for-the-probability-of-violating-a-set-of-conditions%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
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%2f3041999%2fupper-bound-for-the-probability-of-violating-a-set-of-conditions%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