Concentration of two independent sub-Gaussian random variables











up vote
2
down vote

favorite
3












Suppose $X$ and $Y$ are independent sub-Gaussian random variables with 0 mean and $sigma^2$ sub-Gaussian parameter. More specifically, $mathbb E[exp(a^T X)]leq exp{|a|_2^2sigma^2/2}$ for all $a$, and the same holds for $Y$ as well.



I wish to upper bound the tail probability
$$
Prleft[|X^T Y|>tright]
$$
using $sigma^2$ and dimension $n$ (that is, both $X$ and $Y$ are $d$-dimensional random variables). How can I achieve this? $X^T Y$ does not seem to be either sub-Gaussian or sub-exponential.










share|cite|improve this question


























    up vote
    2
    down vote

    favorite
    3












    Suppose $X$ and $Y$ are independent sub-Gaussian random variables with 0 mean and $sigma^2$ sub-Gaussian parameter. More specifically, $mathbb E[exp(a^T X)]leq exp{|a|_2^2sigma^2/2}$ for all $a$, and the same holds for $Y$ as well.



    I wish to upper bound the tail probability
    $$
    Prleft[|X^T Y|>tright]
    $$
    using $sigma^2$ and dimension $n$ (that is, both $X$ and $Y$ are $d$-dimensional random variables). How can I achieve this? $X^T Y$ does not seem to be either sub-Gaussian or sub-exponential.










    share|cite|improve this question
























      up vote
      2
      down vote

      favorite
      3









      up vote
      2
      down vote

      favorite
      3






      3





      Suppose $X$ and $Y$ are independent sub-Gaussian random variables with 0 mean and $sigma^2$ sub-Gaussian parameter. More specifically, $mathbb E[exp(a^T X)]leq exp{|a|_2^2sigma^2/2}$ for all $a$, and the same holds for $Y$ as well.



      I wish to upper bound the tail probability
      $$
      Prleft[|X^T Y|>tright]
      $$
      using $sigma^2$ and dimension $n$ (that is, both $X$ and $Y$ are $d$-dimensional random variables). How can I achieve this? $X^T Y$ does not seem to be either sub-Gaussian or sub-exponential.










      share|cite|improve this question













      Suppose $X$ and $Y$ are independent sub-Gaussian random variables with 0 mean and $sigma^2$ sub-Gaussian parameter. More specifically, $mathbb E[exp(a^T X)]leq exp{|a|_2^2sigma^2/2}$ for all $a$, and the same holds for $Y$ as well.



      I wish to upper bound the tail probability
      $$
      Prleft[|X^T Y|>tright]
      $$
      using $sigma^2$ and dimension $n$ (that is, both $X$ and $Y$ are $d$-dimensional random variables). How can I achieve this? $X^T Y$ does not seem to be either sub-Gaussian or sub-exponential.







      probability concentration-of-measure






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jul 6 '17 at 12:36









      Yining Wang

      774315




      774315






















          3 Answers
          3






          active

          oldest

          votes

















          up vote
          2
          down vote



          accepted
          +50










          Though you are right that the product is in general not sub-Gaussian, but it is still subexponential.



          Note that for a sub-Gaussian vector $X$ in $mathbb{R}^n$ with parameter $sigma^2$ and for $r<sigma^2$,
          $$
          mathrm{E}bigg[expBig{frac{r||X||^2}2Big}bigg] = frac{1}{(2pi r)^{n/2}}int_{mathrm{R}^n} expBig{-frac{||a||^2}{2r}Big}, mathbb{E}[e^{a^T X}]da \
          le frac{1}{(2pi r)^{n/2}}int_{mathrm{R}^n} expBig{-frac{||a||^2}{2r} + frac{||a^2||sigma^2}{2}Big}da = frac{1}{big(2pi (sigma^2-r)big)^{n/2}}.
          $$
          Therefore, thanks to independence, for any $lambda<1$,
          $$
          mathrm{E}big[exp{lambda X^T Y}big] le mathrm{E}bigg[expBig{frac{lambda^2sigma^2||X||^2}2Big}bigg]lefrac{1}{big(2pi sigma^2(1-lambda^2)big)^{n/2}}.
          $$
          Hence you can easily derive an exponential bound for $mathrm{P}(X^TY>t)$.






          share|cite|improve this answer





















          • You're definitely right! I obtained the same results (sub-exponentiality of $X^T Y$) by bounding $mathbb E|X^T Y|^p$ and invoking the Bernstein condition. Anyway I accepted your answer and awarded the bounty.
            – Yining Wang
            Aug 25 '17 at 17:06


















          up vote
          1
          down vote













          By Cauchy-Schwarz, the event $[ |X^TY|>t]$ is a subset of $[| X|>sqrt t] cup[|Y|>sqrt t]$, so its probability is bounded above by $P(| X|>sqrt t)+P(| Y|>sqrt t)$, for which $O(exp{-At})$ bounds can probably be derived, for some $sigma$-dependent $A$.






          share|cite|improve this answer





















          • Thanks for your answer. Unfortunately, I think this upper bound is very loose because $|X|$ is far from 0 because $mathbb E|X|_2^2>0$, and $X^T Y$ is known to concentrate to 0 because $mathbb EX^T Y = 0$. In particular, in the $P(|X|>sqrt{t})$ bound the $t$ can never be arbitrarily small.
            – Yining Wang
            Jul 8 '17 at 1:36










          • And also, this argument applies to dependent $X$ and $Y$: which is not good because we know that when $X$ and $Y$ are independent, $X^T Y$ should be much smaller and close to 0.
            – Yining Wang
            Jul 8 '17 at 1:37


















          up vote
          0
          down vote













          Moment generating functions of subgaussian vector can often be bounded from above by the same moment generating function, with the subgaussian vector replaced by a standard normal. This is equivalent to zhoraster's answer.



          Take $sigma=1$ without loss of generality (otherwise, consider $X/sigma$ and $Y/sigma$ and scale back afterwards).
          Let $g,h$ be standard normal random vectors, independent of $X,Y$. Then by independence,
          [
          E[e^{uX^TY} | X ] = E[e^{u^2|X|^2/2} ] = E[e^{u X^top g}].
          ]
          Now by the law of total expectation, and a similar argument for $Y$,
          [
          E[e^{uX^TY}] le E[ E[e^{u X^T g}| g] ] = E[E[ e^{u^2|g|^2/2} | g]] = E[e^{u g^Th}].
          ]
          So the problem is reduced to bounding the moment generating function where both random vectors are standard normal.






          share|cite|improve this answer





















            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',
            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%2f2348343%2fconcentration-of-two-independent-sub-gaussian-random-variables%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            3 Answers
            3






            active

            oldest

            votes








            3 Answers
            3






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes








            up vote
            2
            down vote



            accepted
            +50










            Though you are right that the product is in general not sub-Gaussian, but it is still subexponential.



            Note that for a sub-Gaussian vector $X$ in $mathbb{R}^n$ with parameter $sigma^2$ and for $r<sigma^2$,
            $$
            mathrm{E}bigg[expBig{frac{r||X||^2}2Big}bigg] = frac{1}{(2pi r)^{n/2}}int_{mathrm{R}^n} expBig{-frac{||a||^2}{2r}Big}, mathbb{E}[e^{a^T X}]da \
            le frac{1}{(2pi r)^{n/2}}int_{mathrm{R}^n} expBig{-frac{||a||^2}{2r} + frac{||a^2||sigma^2}{2}Big}da = frac{1}{big(2pi (sigma^2-r)big)^{n/2}}.
            $$
            Therefore, thanks to independence, for any $lambda<1$,
            $$
            mathrm{E}big[exp{lambda X^T Y}big] le mathrm{E}bigg[expBig{frac{lambda^2sigma^2||X||^2}2Big}bigg]lefrac{1}{big(2pi sigma^2(1-lambda^2)big)^{n/2}}.
            $$
            Hence you can easily derive an exponential bound for $mathrm{P}(X^TY>t)$.






            share|cite|improve this answer





















            • You're definitely right! I obtained the same results (sub-exponentiality of $X^T Y$) by bounding $mathbb E|X^T Y|^p$ and invoking the Bernstein condition. Anyway I accepted your answer and awarded the bounty.
              – Yining Wang
              Aug 25 '17 at 17:06















            up vote
            2
            down vote



            accepted
            +50










            Though you are right that the product is in general not sub-Gaussian, but it is still subexponential.



            Note that for a sub-Gaussian vector $X$ in $mathbb{R}^n$ with parameter $sigma^2$ and for $r<sigma^2$,
            $$
            mathrm{E}bigg[expBig{frac{r||X||^2}2Big}bigg] = frac{1}{(2pi r)^{n/2}}int_{mathrm{R}^n} expBig{-frac{||a||^2}{2r}Big}, mathbb{E}[e^{a^T X}]da \
            le frac{1}{(2pi r)^{n/2}}int_{mathrm{R}^n} expBig{-frac{||a||^2}{2r} + frac{||a^2||sigma^2}{2}Big}da = frac{1}{big(2pi (sigma^2-r)big)^{n/2}}.
            $$
            Therefore, thanks to independence, for any $lambda<1$,
            $$
            mathrm{E}big[exp{lambda X^T Y}big] le mathrm{E}bigg[expBig{frac{lambda^2sigma^2||X||^2}2Big}bigg]lefrac{1}{big(2pi sigma^2(1-lambda^2)big)^{n/2}}.
            $$
            Hence you can easily derive an exponential bound for $mathrm{P}(X^TY>t)$.






            share|cite|improve this answer





















            • You're definitely right! I obtained the same results (sub-exponentiality of $X^T Y$) by bounding $mathbb E|X^T Y|^p$ and invoking the Bernstein condition. Anyway I accepted your answer and awarded the bounty.
              – Yining Wang
              Aug 25 '17 at 17:06













            up vote
            2
            down vote



            accepted
            +50







            up vote
            2
            down vote



            accepted
            +50




            +50




            Though you are right that the product is in general not sub-Gaussian, but it is still subexponential.



            Note that for a sub-Gaussian vector $X$ in $mathbb{R}^n$ with parameter $sigma^2$ and for $r<sigma^2$,
            $$
            mathrm{E}bigg[expBig{frac{r||X||^2}2Big}bigg] = frac{1}{(2pi r)^{n/2}}int_{mathrm{R}^n} expBig{-frac{||a||^2}{2r}Big}, mathbb{E}[e^{a^T X}]da \
            le frac{1}{(2pi r)^{n/2}}int_{mathrm{R}^n} expBig{-frac{||a||^2}{2r} + frac{||a^2||sigma^2}{2}Big}da = frac{1}{big(2pi (sigma^2-r)big)^{n/2}}.
            $$
            Therefore, thanks to independence, for any $lambda<1$,
            $$
            mathrm{E}big[exp{lambda X^T Y}big] le mathrm{E}bigg[expBig{frac{lambda^2sigma^2||X||^2}2Big}bigg]lefrac{1}{big(2pi sigma^2(1-lambda^2)big)^{n/2}}.
            $$
            Hence you can easily derive an exponential bound for $mathrm{P}(X^TY>t)$.






            share|cite|improve this answer












            Though you are right that the product is in general not sub-Gaussian, but it is still subexponential.



            Note that for a sub-Gaussian vector $X$ in $mathbb{R}^n$ with parameter $sigma^2$ and for $r<sigma^2$,
            $$
            mathrm{E}bigg[expBig{frac{r||X||^2}2Big}bigg] = frac{1}{(2pi r)^{n/2}}int_{mathrm{R}^n} expBig{-frac{||a||^2}{2r}Big}, mathbb{E}[e^{a^T X}]da \
            le frac{1}{(2pi r)^{n/2}}int_{mathrm{R}^n} expBig{-frac{||a||^2}{2r} + frac{||a^2||sigma^2}{2}Big}da = frac{1}{big(2pi (sigma^2-r)big)^{n/2}}.
            $$
            Therefore, thanks to independence, for any $lambda<1$,
            $$
            mathrm{E}big[exp{lambda X^T Y}big] le mathrm{E}bigg[expBig{frac{lambda^2sigma^2||X||^2}2Big}bigg]lefrac{1}{big(2pi sigma^2(1-lambda^2)big)^{n/2}}.
            $$
            Hence you can easily derive an exponential bound for $mathrm{P}(X^TY>t)$.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Aug 25 '17 at 6:14









            zhoraster

            15.5k21752




            15.5k21752












            • You're definitely right! I obtained the same results (sub-exponentiality of $X^T Y$) by bounding $mathbb E|X^T Y|^p$ and invoking the Bernstein condition. Anyway I accepted your answer and awarded the bounty.
              – Yining Wang
              Aug 25 '17 at 17:06


















            • You're definitely right! I obtained the same results (sub-exponentiality of $X^T Y$) by bounding $mathbb E|X^T Y|^p$ and invoking the Bernstein condition. Anyway I accepted your answer and awarded the bounty.
              – Yining Wang
              Aug 25 '17 at 17:06
















            You're definitely right! I obtained the same results (sub-exponentiality of $X^T Y$) by bounding $mathbb E|X^T Y|^p$ and invoking the Bernstein condition. Anyway I accepted your answer and awarded the bounty.
            – Yining Wang
            Aug 25 '17 at 17:06




            You're definitely right! I obtained the same results (sub-exponentiality of $X^T Y$) by bounding $mathbb E|X^T Y|^p$ and invoking the Bernstein condition. Anyway I accepted your answer and awarded the bounty.
            – Yining Wang
            Aug 25 '17 at 17:06










            up vote
            1
            down vote













            By Cauchy-Schwarz, the event $[ |X^TY|>t]$ is a subset of $[| X|>sqrt t] cup[|Y|>sqrt t]$, so its probability is bounded above by $P(| X|>sqrt t)+P(| Y|>sqrt t)$, for which $O(exp{-At})$ bounds can probably be derived, for some $sigma$-dependent $A$.






            share|cite|improve this answer





















            • Thanks for your answer. Unfortunately, I think this upper bound is very loose because $|X|$ is far from 0 because $mathbb E|X|_2^2>0$, and $X^T Y$ is known to concentrate to 0 because $mathbb EX^T Y = 0$. In particular, in the $P(|X|>sqrt{t})$ bound the $t$ can never be arbitrarily small.
              – Yining Wang
              Jul 8 '17 at 1:36










            • And also, this argument applies to dependent $X$ and $Y$: which is not good because we know that when $X$ and $Y$ are independent, $X^T Y$ should be much smaller and close to 0.
              – Yining Wang
              Jul 8 '17 at 1:37















            up vote
            1
            down vote













            By Cauchy-Schwarz, the event $[ |X^TY|>t]$ is a subset of $[| X|>sqrt t] cup[|Y|>sqrt t]$, so its probability is bounded above by $P(| X|>sqrt t)+P(| Y|>sqrt t)$, for which $O(exp{-At})$ bounds can probably be derived, for some $sigma$-dependent $A$.






            share|cite|improve this answer





















            • Thanks for your answer. Unfortunately, I think this upper bound is very loose because $|X|$ is far from 0 because $mathbb E|X|_2^2>0$, and $X^T Y$ is known to concentrate to 0 because $mathbb EX^T Y = 0$. In particular, in the $P(|X|>sqrt{t})$ bound the $t$ can never be arbitrarily small.
              – Yining Wang
              Jul 8 '17 at 1:36










            • And also, this argument applies to dependent $X$ and $Y$: which is not good because we know that when $X$ and $Y$ are independent, $X^T Y$ should be much smaller and close to 0.
              – Yining Wang
              Jul 8 '17 at 1:37













            up vote
            1
            down vote










            up vote
            1
            down vote









            By Cauchy-Schwarz, the event $[ |X^TY|>t]$ is a subset of $[| X|>sqrt t] cup[|Y|>sqrt t]$, so its probability is bounded above by $P(| X|>sqrt t)+P(| Y|>sqrt t)$, for which $O(exp{-At})$ bounds can probably be derived, for some $sigma$-dependent $A$.






            share|cite|improve this answer












            By Cauchy-Schwarz, the event $[ |X^TY|>t]$ is a subset of $[| X|>sqrt t] cup[|Y|>sqrt t]$, so its probability is bounded above by $P(| X|>sqrt t)+P(| Y|>sqrt t)$, for which $O(exp{-At})$ bounds can probably be derived, for some $sigma$-dependent $A$.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Jul 6 '17 at 17:39









            kimchi lover

            9,44331128




            9,44331128












            • Thanks for your answer. Unfortunately, I think this upper bound is very loose because $|X|$ is far from 0 because $mathbb E|X|_2^2>0$, and $X^T Y$ is known to concentrate to 0 because $mathbb EX^T Y = 0$. In particular, in the $P(|X|>sqrt{t})$ bound the $t$ can never be arbitrarily small.
              – Yining Wang
              Jul 8 '17 at 1:36










            • And also, this argument applies to dependent $X$ and $Y$: which is not good because we know that when $X$ and $Y$ are independent, $X^T Y$ should be much smaller and close to 0.
              – Yining Wang
              Jul 8 '17 at 1:37


















            • Thanks for your answer. Unfortunately, I think this upper bound is very loose because $|X|$ is far from 0 because $mathbb E|X|_2^2>0$, and $X^T Y$ is known to concentrate to 0 because $mathbb EX^T Y = 0$. In particular, in the $P(|X|>sqrt{t})$ bound the $t$ can never be arbitrarily small.
              – Yining Wang
              Jul 8 '17 at 1:36










            • And also, this argument applies to dependent $X$ and $Y$: which is not good because we know that when $X$ and $Y$ are independent, $X^T Y$ should be much smaller and close to 0.
              – Yining Wang
              Jul 8 '17 at 1:37
















            Thanks for your answer. Unfortunately, I think this upper bound is very loose because $|X|$ is far from 0 because $mathbb E|X|_2^2>0$, and $X^T Y$ is known to concentrate to 0 because $mathbb EX^T Y = 0$. In particular, in the $P(|X|>sqrt{t})$ bound the $t$ can never be arbitrarily small.
            – Yining Wang
            Jul 8 '17 at 1:36




            Thanks for your answer. Unfortunately, I think this upper bound is very loose because $|X|$ is far from 0 because $mathbb E|X|_2^2>0$, and $X^T Y$ is known to concentrate to 0 because $mathbb EX^T Y = 0$. In particular, in the $P(|X|>sqrt{t})$ bound the $t$ can never be arbitrarily small.
            – Yining Wang
            Jul 8 '17 at 1:36












            And also, this argument applies to dependent $X$ and $Y$: which is not good because we know that when $X$ and $Y$ are independent, $X^T Y$ should be much smaller and close to 0.
            – Yining Wang
            Jul 8 '17 at 1:37




            And also, this argument applies to dependent $X$ and $Y$: which is not good because we know that when $X$ and $Y$ are independent, $X^T Y$ should be much smaller and close to 0.
            – Yining Wang
            Jul 8 '17 at 1:37










            up vote
            0
            down vote













            Moment generating functions of subgaussian vector can often be bounded from above by the same moment generating function, with the subgaussian vector replaced by a standard normal. This is equivalent to zhoraster's answer.



            Take $sigma=1$ without loss of generality (otherwise, consider $X/sigma$ and $Y/sigma$ and scale back afterwards).
            Let $g,h$ be standard normal random vectors, independent of $X,Y$. Then by independence,
            [
            E[e^{uX^TY} | X ] = E[e^{u^2|X|^2/2} ] = E[e^{u X^top g}].
            ]
            Now by the law of total expectation, and a similar argument for $Y$,
            [
            E[e^{uX^TY}] le E[ E[e^{u X^T g}| g] ] = E[E[ e^{u^2|g|^2/2} | g]] = E[e^{u g^Th}].
            ]
            So the problem is reduced to bounding the moment generating function where both random vectors are standard normal.






            share|cite|improve this answer

























              up vote
              0
              down vote













              Moment generating functions of subgaussian vector can often be bounded from above by the same moment generating function, with the subgaussian vector replaced by a standard normal. This is equivalent to zhoraster's answer.



              Take $sigma=1$ without loss of generality (otherwise, consider $X/sigma$ and $Y/sigma$ and scale back afterwards).
              Let $g,h$ be standard normal random vectors, independent of $X,Y$. Then by independence,
              [
              E[e^{uX^TY} | X ] = E[e^{u^2|X|^2/2} ] = E[e^{u X^top g}].
              ]
              Now by the law of total expectation, and a similar argument for $Y$,
              [
              E[e^{uX^TY}] le E[ E[e^{u X^T g}| g] ] = E[E[ e^{u^2|g|^2/2} | g]] = E[e^{u g^Th}].
              ]
              So the problem is reduced to bounding the moment generating function where both random vectors are standard normal.






              share|cite|improve this answer























                up vote
                0
                down vote










                up vote
                0
                down vote









                Moment generating functions of subgaussian vector can often be bounded from above by the same moment generating function, with the subgaussian vector replaced by a standard normal. This is equivalent to zhoraster's answer.



                Take $sigma=1$ without loss of generality (otherwise, consider $X/sigma$ and $Y/sigma$ and scale back afterwards).
                Let $g,h$ be standard normal random vectors, independent of $X,Y$. Then by independence,
                [
                E[e^{uX^TY} | X ] = E[e^{u^2|X|^2/2} ] = E[e^{u X^top g}].
                ]
                Now by the law of total expectation, and a similar argument for $Y$,
                [
                E[e^{uX^TY}] le E[ E[e^{u X^T g}| g] ] = E[E[ e^{u^2|g|^2/2} | g]] = E[e^{u g^Th}].
                ]
                So the problem is reduced to bounding the moment generating function where both random vectors are standard normal.






                share|cite|improve this answer












                Moment generating functions of subgaussian vector can often be bounded from above by the same moment generating function, with the subgaussian vector replaced by a standard normal. This is equivalent to zhoraster's answer.



                Take $sigma=1$ without loss of generality (otherwise, consider $X/sigma$ and $Y/sigma$ and scale back afterwards).
                Let $g,h$ be standard normal random vectors, independent of $X,Y$. Then by independence,
                [
                E[e^{uX^TY} | X ] = E[e^{u^2|X|^2/2} ] = E[e^{u X^top g}].
                ]
                Now by the law of total expectation, and a similar argument for $Y$,
                [
                E[e^{uX^TY}] le E[ E[e^{u X^T g}| g] ] = E[E[ e^{u^2|g|^2/2} | g]] = E[e^{u g^Th}].
                ]
                So the problem is reduced to bounding the moment generating function where both random vectors are standard normal.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Dec 1 at 1:02









                jlewk

                765




                765






























                    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.





                    Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                    Please pay close attention to the following guidance:


                    • 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.


                    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%2f2348343%2fconcentration-of-two-independent-sub-gaussian-random-variables%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

                    Måne

                    Storängen

                    VLT Carioca