Tight upper bound on the expectation of a concave function
$begingroup$
N is a random variable whose sample space is $[0,infty)$. I have an expression in terms of the expectation of this variable and I want to find a tight upper bound on the whole expression. The expression is as below:
$1-gamma E[frac{(N+1)}{(1+bcdot N+gamma cdot N+b+gamma)}]$ where $gamma >0$ and $b>0$
I don't know the distribution of N but assuming that I know the $E[N]$, can a tight bound be established on the above expression? If so, can you please refer me to theorems/inequalities that would help me find it?
I looked at Jensen's inequality but it provides a lower bound since the expression over which the expectation is being taken is concave.
(This expression is actually a bound on the probability mass for a subset of the sample space but I don't know the distribution.)
PS: I have asked this question on other platforms but haven't received any answers.
expected-value
$endgroup$
add a comment |
$begingroup$
N is a random variable whose sample space is $[0,infty)$. I have an expression in terms of the expectation of this variable and I want to find a tight upper bound on the whole expression. The expression is as below:
$1-gamma E[frac{(N+1)}{(1+bcdot N+gamma cdot N+b+gamma)}]$ where $gamma >0$ and $b>0$
I don't know the distribution of N but assuming that I know the $E[N]$, can a tight bound be established on the above expression? If so, can you please refer me to theorems/inequalities that would help me find it?
I looked at Jensen's inequality but it provides a lower bound since the expression over which the expectation is being taken is concave.
(This expression is actually a bound on the probability mass for a subset of the sample space but I don't know the distribution.)
PS: I have asked this question on other platforms but haven't received any answers.
expected-value
$endgroup$
add a comment |
$begingroup$
N is a random variable whose sample space is $[0,infty)$. I have an expression in terms of the expectation of this variable and I want to find a tight upper bound on the whole expression. The expression is as below:
$1-gamma E[frac{(N+1)}{(1+bcdot N+gamma cdot N+b+gamma)}]$ where $gamma >0$ and $b>0$
I don't know the distribution of N but assuming that I know the $E[N]$, can a tight bound be established on the above expression? If so, can you please refer me to theorems/inequalities that would help me find it?
I looked at Jensen's inequality but it provides a lower bound since the expression over which the expectation is being taken is concave.
(This expression is actually a bound on the probability mass for a subset of the sample space but I don't know the distribution.)
PS: I have asked this question on other platforms but haven't received any answers.
expected-value
$endgroup$
N is a random variable whose sample space is $[0,infty)$. I have an expression in terms of the expectation of this variable and I want to find a tight upper bound on the whole expression. The expression is as below:
$1-gamma E[frac{(N+1)}{(1+bcdot N+gamma cdot N+b+gamma)}]$ where $gamma >0$ and $b>0$
I don't know the distribution of N but assuming that I know the $E[N]$, can a tight bound be established on the above expression? If so, can you please refer me to theorems/inequalities that would help me find it?
I looked at Jensen's inequality but it provides a lower bound since the expression over which the expectation is being taken is concave.
(This expression is actually a bound on the probability mass for a subset of the sample space but I don't know the distribution.)
PS: I have asked this question on other platforms but haven't received any answers.
expected-value
expected-value
edited Dec 6 '18 at 5:37
Tianlalu
3,08621038
3,08621038
asked Dec 6 '18 at 4:38
gagansogaganso
155211
155211
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%2f3028038%2ftight-upper-bound-on-the-expectation-of-a-concave-function%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%2f3028038%2ftight-upper-bound-on-the-expectation-of-a-concave-function%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