Upper bound $ mathbb{P}leftlbrace sumlimits_{substack{i}}^{n} dfrac{1}{mathbf{N(x_{i})}}> dfrac{tn}{4}...












0












$begingroup$


Is it possible to upper bound the probability bellow using Chernoff bound?



$$ mathbb{P}leftlbrace sumlimits_{substack{i}}^{n} dfrac{1}{mathbf{N(x_{i})}}> dfrac{tn}{4} +dfrac{n}{a_{n}} rightrbrace, $$



where, $t$ and $a_{n}$ are constants. Also, $mathbf{N}(x_{i})=Y_{i}+1$ is a random variable with $Y_{i} sim Bin(n-1, r_{n}).$ The terms $Y_{i}$ are mutually dependent.



The problem is that I do not know the distribution of $sumlimits_{substack{i}}^{n} dfrac{1}{mathbf{N(x_{i})}}$. I only know the distribution of $ sumlimits_{substack{i}}^{n} mathbf{N(x_{i})}$ but I could not have this term in the probability.



I could also do,



$$ mathbb{P}leftlbrace sumlimits_{substack{i}}^{n} dfrac{1}{mathbf{N(x_{i})}}> dfrac{tn}{4} +dfrac{n}{a_{n}} rightrbrace leq n max_{i} mathbb{P}leftlbrace dfrac{1}{mathbf{N(x_{i})}}> dfrac{t}{4} +dfrac{1}{a_{n}} rightrbrace$$



Then, I use the Chernoff bound but the obtained bound is not tight enough. So, I want to use the distribution of term $ sumlimits_{substack{i}}^{n} mathbf{N(x_{i})}$.






calculus probability sequences-and-series probability-theory probability-distributions







share|cite|improve this question











$endgroup$












  • $begingroup$
    You never need to know the distribution of the random variables to apply Hoeffding, Chernoff, or similar bounds. You need, roughly speaking (there are strenghtenings) the summands to be independent and bounded say in $[0,1]$. This is clearly the case here (at least, based on what you write, I assume the $N(x_i)$ are independent?).
    $endgroup$
    – Clement C.
    Dec 14 '18 at 0:57












  • $begingroup$
    Now, Chernoff may not give you the best bound you could possibly obtain, so it's for you to see if what it gives is enough for what you have in mind.
    $endgroup$
    – Clement C.
    Dec 14 '18 at 0:59










  • $begingroup$
    I cannot apply Chernoff bound here because I do not have independence between $mathbf{N(x_{i})}$ for each $i$.
    $endgroup$
    – Mounia Hamidouche
    Dec 14 '18 at 1:00












  • $begingroup$
    Why do you not have independence? In your question, this is very unclear: $N_i = N(x_i)$ is "1+ a binomial." Where are the dependences?
    $endgroup$
    – Clement C.
    Dec 14 '18 at 1:02






  • 1




    $begingroup$
    Why did you not mention these dependencies in the question? that's the very core of the question.
    $endgroup$
    – Clement C.
    Dec 14 '18 at 1:07


















0












$begingroup$


Is it possible to upper bound the probability bellow using Chernoff bound?



$$ mathbb{P}leftlbrace sumlimits_{substack{i}}^{n} dfrac{1}{mathbf{N(x_{i})}}> dfrac{tn}{4} +dfrac{n}{a_{n}} rightrbrace, $$



where, $t$ and $a_{n}$ are constants. Also, $mathbf{N}(x_{i})=Y_{i}+1$ is a random variable with $Y_{i} sim Bin(n-1, r_{n}).$ The terms $Y_{i}$ are mutually dependent.



The problem is that I do not know the distribution of $sumlimits_{substack{i}}^{n} dfrac{1}{mathbf{N(x_{i})}}$. I only know the distribution of $ sumlimits_{substack{i}}^{n} mathbf{N(x_{i})}$ but I could not have this term in the probability.



I could also do,



$$ mathbb{P}leftlbrace sumlimits_{substack{i}}^{n} dfrac{1}{mathbf{N(x_{i})}}> dfrac{tn}{4} +dfrac{n}{a_{n}} rightrbrace leq n max_{i} mathbb{P}leftlbrace dfrac{1}{mathbf{N(x_{i})}}> dfrac{t}{4} +dfrac{1}{a_{n}} rightrbrace$$



Then, I use the Chernoff bound but the obtained bound is not tight enough. So, I want to use the distribution of term $ sumlimits_{substack{i}}^{n} mathbf{N(x_{i})}$.






calculus probability sequences-and-series probability-theory probability-distributions







share|cite|improve this question











$endgroup$












  • $begingroup$
    You never need to know the distribution of the random variables to apply Hoeffding, Chernoff, or similar bounds. You need, roughly speaking (there are strenghtenings) the summands to be independent and bounded say in $[0,1]$. This is clearly the case here (at least, based on what you write, I assume the $N(x_i)$ are independent?).
    $endgroup$
    – Clement C.
    Dec 14 '18 at 0:57












  • $begingroup$
    Now, Chernoff may not give you the best bound you could possibly obtain, so it's for you to see if what it gives is enough for what you have in mind.
    $endgroup$
    – Clement C.
    Dec 14 '18 at 0:59










  • $begingroup$
    I cannot apply Chernoff bound here because I do not have independence between $mathbf{N(x_{i})}$ for each $i$.
    $endgroup$
    – Mounia Hamidouche
    Dec 14 '18 at 1:00












  • $begingroup$
    Why do you not have independence? In your question, this is very unclear: $N_i = N(x_i)$ is "1+ a binomial." Where are the dependences?
    $endgroup$
    – Clement C.
    Dec 14 '18 at 1:02






  • 1




    $begingroup$
    Why did you not mention these dependencies in the question? that's the very core of the question.
    $endgroup$
    – Clement C.
    Dec 14 '18 at 1:07
















0












0








0





$begingroup$


Is it possible to upper bound the probability bellow using Chernoff bound?



$$ mathbb{P}leftlbrace sumlimits_{substack{i}}^{n} dfrac{1}{mathbf{N(x_{i})}}> dfrac{tn}{4} +dfrac{n}{a_{n}} rightrbrace, $$



where, $t$ and $a_{n}$ are constants. Also, $mathbf{N}(x_{i})=Y_{i}+1$ is a random variable with $Y_{i} sim Bin(n-1, r_{n}).$ The terms $Y_{i}$ are mutually dependent.



The problem is that I do not know the distribution of $sumlimits_{substack{i}}^{n} dfrac{1}{mathbf{N(x_{i})}}$. I only know the distribution of $ sumlimits_{substack{i}}^{n} mathbf{N(x_{i})}$ but I could not have this term in the probability.



I could also do,



$$ mathbb{P}leftlbrace sumlimits_{substack{i}}^{n} dfrac{1}{mathbf{N(x_{i})}}> dfrac{tn}{4} +dfrac{n}{a_{n}} rightrbrace leq n max_{i} mathbb{P}leftlbrace dfrac{1}{mathbf{N(x_{i})}}> dfrac{t}{4} +dfrac{1}{a_{n}} rightrbrace$$



Then, I use the Chernoff bound but the obtained bound is not tight enough. So, I want to use the distribution of term $ sumlimits_{substack{i}}^{n} mathbf{N(x_{i})}$.






calculus probability sequences-and-series probability-theory probability-distributions







share|cite|improve this question











$endgroup$




Is it possible to upper bound the probability bellow using Chernoff bound?



$$ mathbb{P}leftlbrace sumlimits_{substack{i}}^{n} dfrac{1}{mathbf{N(x_{i})}}> dfrac{tn}{4} +dfrac{n}{a_{n}} rightrbrace, $$



where, $t$ and $a_{n}$ are constants. Also, $mathbf{N}(x_{i})=Y_{i}+1$ is a random variable with $Y_{i} sim Bin(n-1, r_{n}).$ The terms $Y_{i}$ are mutually dependent.



The problem is that I do not know the distribution of $sumlimits_{substack{i}}^{n} dfrac{1}{mathbf{N(x_{i})}}$. I only know the distribution of $ sumlimits_{substack{i}}^{n} mathbf{N(x_{i})}$ but I could not have this term in the probability.



I could also do,



$$ mathbb{P}leftlbrace sumlimits_{substack{i}}^{n} dfrac{1}{mathbf{N(x_{i})}}> dfrac{tn}{4} +dfrac{n}{a_{n}} rightrbrace leq n max_{i} mathbb{P}leftlbrace dfrac{1}{mathbf{N(x_{i})}}> dfrac{t}{4} +dfrac{1}{a_{n}} rightrbrace$$



Then, I use the Chernoff bound but the obtained bound is not tight enough. So, I want to use the distribution of term $ sumlimits_{substack{i}}^{n} mathbf{N(x_{i})}$.






calculus probability sequences-and-series probability-theory probability-distributions




calculus probability sequences-and-series probability-theory probability-distributions






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 14 '18 at 1:10







Mounia Hamidouche

















asked Dec 14 '18 at 0:44









Mounia HamidoucheMounia Hamidouche

32419




32419












  • $begingroup$
    You never need to know the distribution of the random variables to apply Hoeffding, Chernoff, or similar bounds. You need, roughly speaking (there are strenghtenings) the summands to be independent and bounded say in $[0,1]$. This is clearly the case here (at least, based on what you write, I assume the $N(x_i)$ are independent?).
    $endgroup$
    – Clement C.
    Dec 14 '18 at 0:57












  • $begingroup$
    Now, Chernoff may not give you the best bound you could possibly obtain, so it's for you to see if what it gives is enough for what you have in mind.
    $endgroup$
    – Clement C.
    Dec 14 '18 at 0:59










  • $begingroup$
    I cannot apply Chernoff bound here because I do not have independence between $mathbf{N(x_{i})}$ for each $i$.
    $endgroup$
    – Mounia Hamidouche
    Dec 14 '18 at 1:00












  • $begingroup$
    Why do you not have independence? In your question, this is very unclear: $N_i = N(x_i)$ is "1+ a binomial." Where are the dependences?
    $endgroup$
    – Clement C.
    Dec 14 '18 at 1:02






  • 1




    $begingroup$
    Why did you not mention these dependencies in the question? that's the very core of the question.
    $endgroup$
    – Clement C.
    Dec 14 '18 at 1:07




















  • $begingroup$
    You never need to know the distribution of the random variables to apply Hoeffding, Chernoff, or similar bounds. You need, roughly speaking (there are strenghtenings) the summands to be independent and bounded say in $[0,1]$. This is clearly the case here (at least, based on what you write, I assume the $N(x_i)$ are independent?).
    $endgroup$
    – Clement C.
    Dec 14 '18 at 0:57












  • $begingroup$
    Now, Chernoff may not give you the best bound you could possibly obtain, so it's for you to see if what it gives is enough for what you have in mind.
    $endgroup$
    – Clement C.
    Dec 14 '18 at 0:59










  • $begingroup$
    I cannot apply Chernoff bound here because I do not have independence between $mathbf{N(x_{i})}$ for each $i$.
    $endgroup$
    – Mounia Hamidouche
    Dec 14 '18 at 1:00












  • $begingroup$
    Why do you not have independence? In your question, this is very unclear: $N_i = N(x_i)$ is "1+ a binomial." Where are the dependences?
    $endgroup$
    – Clement C.
    Dec 14 '18 at 1:02






  • 1




    $begingroup$
    Why did you not mention these dependencies in the question? that's the very core of the question.
    $endgroup$
    – Clement C.
    Dec 14 '18 at 1:07


















$begingroup$
You never need to know the distribution of the random variables to apply Hoeffding, Chernoff, or similar bounds. You need, roughly speaking (there are strenghtenings) the summands to be independent and bounded say in $[0,1]$. This is clearly the case here (at least, based on what you write, I assume the $N(x_i)$ are independent?).
$endgroup$
– Clement C.
Dec 14 '18 at 0:57






$begingroup$
You never need to know the distribution of the random variables to apply Hoeffding, Chernoff, or similar bounds. You need, roughly speaking (there are strenghtenings) the summands to be independent and bounded say in $[0,1]$. This is clearly the case here (at least, based on what you write, I assume the $N(x_i)$ are independent?).
$endgroup$
– Clement C.
Dec 14 '18 at 0:57














$begingroup$
Now, Chernoff may not give you the best bound you could possibly obtain, so it's for you to see if what it gives is enough for what you have in mind.
$endgroup$
– Clement C.
Dec 14 '18 at 0:59




$begingroup$
Now, Chernoff may not give you the best bound you could possibly obtain, so it's for you to see if what it gives is enough for what you have in mind.
$endgroup$
– Clement C.
Dec 14 '18 at 0:59












$begingroup$
I cannot apply Chernoff bound here because I do not have independence between $mathbf{N(x_{i})}$ for each $i$.
$endgroup$
– Mounia Hamidouche
Dec 14 '18 at 1:00






$begingroup$
I cannot apply Chernoff bound here because I do not have independence between $mathbf{N(x_{i})}$ for each $i$.
$endgroup$
– Mounia Hamidouche
Dec 14 '18 at 1:00














$begingroup$
Why do you not have independence? In your question, this is very unclear: $N_i = N(x_i)$ is "1+ a binomial." Where are the dependences?
$endgroup$
– Clement C.
Dec 14 '18 at 1:02




$begingroup$
Why do you not have independence? In your question, this is very unclear: $N_i = N(x_i)$ is "1+ a binomial." Where are the dependences?
$endgroup$
– Clement C.
Dec 14 '18 at 1:02




1




1




$begingroup$
Why did you not mention these dependencies in the question? that's the very core of the question.
$endgroup$
– Clement C.
Dec 14 '18 at 1:07






$begingroup$
Why did you not mention these dependencies in the question? that's the very core of the question.
$endgroup$
– Clement C.
Dec 14 '18 at 1:07












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


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3038785%2fupper-bound-mathbbp-left-lbrace-sum-limits-substackin-dfrac1-m%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
















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%2f3038785%2fupper-bound-mathbbp-left-lbrace-sum-limits-substackin-dfrac1-m%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

Ellipse (mathématiques)

Image
Pour les articles homonymes, voir Ellipse. L'ellipse est le lieu des points dont la somme des distances à deux points fixes, dits foyers, est constante. Section du cône ou projection du cercle. En géométrie, une ellipse est une courbe plane fermée obtenue par l’intersection d’un cône de révolution avec un plan, à condition que celui-ci coupe l'axe de rotation du cône ou du cylindre : c'est une conique d'excentricité strictement comprise entre 0 et 1. On peut également la définir comme le lieu des points dont la somme des distances à deux points fixes, dits foyers, est constante (sa construction par la méthode du jardinier est très simple). Dans la vie courante, l’ellipse est la forme qu'on perçoit en regardant un cercle en perspective, ou la figure formée par l’ombre d'un disque sur une surface plane. On retrouve aussi, en première approximation [ 1 ] , des ellipses dans les trajectoires des corps célestes (planètes, comètes ou satellites arti...
Read more

Quarter-circle Tiles

Image
up vote 0 down vote favorite I have $99$ identical square tiles, each with a quarter-circle drawn on it like this: [asy] size(1.5cm); draw(Arc((2,0),1,90,180),red+1); draw((0,0)--(2,0)--(2,2)--(0,2)--(0,0)); [/asy] When I arrange the tiles in a $9times 11$ rectangular grid, each with a random orientation, what is the expected value of the number of full circles I form? I think this problem has to do with finding the chance any given 2x2 square has a circle, but I can't find it. expected-value share | cite | improve this question asked Nov 20 at 15:03 6minecraftninja 1 2 ...
Read more

Mont Emei

Image
Mont Emei.mw-parser-output .entete.map{background-image:url("//upload.wikimedia.org/wikipedia/commons/7/7a/Picto_infobox_map.png")} Vue du sommet Wanfo du mont Emei Géographie Altitude 3 099  m , Wanfo Coordonnées 29° 31′ 11″ nord, 103° 19′ 57″ est Administration Pays   Chine Province Sichuan Ville-préfecture Leshan Géolocalisation sur la carte : Sichuan Mont Emei Géolocalisation sur la carte : Chine Mont Emei modifier   Paysage panoramique du mont Emei, incluant le paysage panoramique du grand Bouddha de Leshan *   Patrimoine mondial de l'UNESCO Passerelle en bois sur le versant ouest Pays   Chine Subdivision Sichuan Type Mixte Critères (iv) (vi) (x) Superficie 15 400 ha Numéro d’identification 779 Zone géographique Asie et Pacifique  ** Année d’inscription 1996 (20 e session) * Descriptif officiel UNESCO ** Classification géog...
Read more