Let $Y_n = X_n + X_{n+1}$ and $T_n = frac{1}{n} sum_{i=1}^n Y_i$. I want to find $Var[T_n]$












0














Let $Y_n = X_n + X_{n+1}$ with $X_n$ ~ Bernoulli$(p)$ independent and identically distributed. Let $T_n = frac{1}{n} sum_{i=1}^n Y_i$. I want to find $Var[T_n]$.



This is what I have done so far:



I know that $Y_n$ ~ Bin(2,p). Then I can write this:



$$ Var[T_n] = Var[frac{1}{n}sum_{i=1}^n Y_i]= frac{1}{n^2}Var[sum_{i=1}^n Y_i] =$$



$$=frac{1}{n^2}sum_{i=1}^nVar[ Y_i] = frac{1}{n^2}*n* 2p(1-p) $$



However, the result should actually contain a $frac{2n-1}{n^2}$. Can somebody point out my mistake?










share|cite|improve this question






















  • The random variables $Y_i$ are not independent and therefore $text{var}(sum_{i} Y_i) = sum_i text{var}(Y_i)$ fails to hold true.
    – saz
    yesterday
















0














Let $Y_n = X_n + X_{n+1}$ with $X_n$ ~ Bernoulli$(p)$ independent and identically distributed. Let $T_n = frac{1}{n} sum_{i=1}^n Y_i$. I want to find $Var[T_n]$.



This is what I have done so far:



I know that $Y_n$ ~ Bin(2,p). Then I can write this:



$$ Var[T_n] = Var[frac{1}{n}sum_{i=1}^n Y_i]= frac{1}{n^2}Var[sum_{i=1}^n Y_i] =$$



$$=frac{1}{n^2}sum_{i=1}^nVar[ Y_i] = frac{1}{n^2}*n* 2p(1-p) $$



However, the result should actually contain a $frac{2n-1}{n^2}$. Can somebody point out my mistake?










share|cite|improve this question






















  • The random variables $Y_i$ are not independent and therefore $text{var}(sum_{i} Y_i) = sum_i text{var}(Y_i)$ fails to hold true.
    – saz
    yesterday














0












0








0







Let $Y_n = X_n + X_{n+1}$ with $X_n$ ~ Bernoulli$(p)$ independent and identically distributed. Let $T_n = frac{1}{n} sum_{i=1}^n Y_i$. I want to find $Var[T_n]$.



This is what I have done so far:



I know that $Y_n$ ~ Bin(2,p). Then I can write this:



$$ Var[T_n] = Var[frac{1}{n}sum_{i=1}^n Y_i]= frac{1}{n^2}Var[sum_{i=1}^n Y_i] =$$



$$=frac{1}{n^2}sum_{i=1}^nVar[ Y_i] = frac{1}{n^2}*n* 2p(1-p) $$



However, the result should actually contain a $frac{2n-1}{n^2}$. Can somebody point out my mistake?










share|cite|improve this question













Let $Y_n = X_n + X_{n+1}$ with $X_n$ ~ Bernoulli$(p)$ independent and identically distributed. Let $T_n = frac{1}{n} sum_{i=1}^n Y_i$. I want to find $Var[T_n]$.



This is what I have done so far:



I know that $Y_n$ ~ Bin(2,p). Then I can write this:



$$ Var[T_n] = Var[frac{1}{n}sum_{i=1}^n Y_i]= frac{1}{n^2}Var[sum_{i=1}^n Y_i] =$$



$$=frac{1}{n^2}sum_{i=1}^nVar[ Y_i] = frac{1}{n^2}*n* 2p(1-p) $$



However, the result should actually contain a $frac{2n-1}{n^2}$. Can somebody point out my mistake?







probability convergence






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked yesterday









qcc101

479113




479113












  • The random variables $Y_i$ are not independent and therefore $text{var}(sum_{i} Y_i) = sum_i text{var}(Y_i)$ fails to hold true.
    – saz
    yesterday


















  • The random variables $Y_i$ are not independent and therefore $text{var}(sum_{i} Y_i) = sum_i text{var}(Y_i)$ fails to hold true.
    – saz
    yesterday
















The random variables $Y_i$ are not independent and therefore $text{var}(sum_{i} Y_i) = sum_i text{var}(Y_i)$ fails to hold true.
– saz
yesterday




The random variables $Y_i$ are not independent and therefore $text{var}(sum_{i} Y_i) = sum_i text{var}(Y_i)$ fails to hold true.
– saz
yesterday










1 Answer
1






active

oldest

votes


















1














Hints:




  • The $Y_i$s are not independent so you cannot just sum their variances


  • Consider $Var[T_n] = Varleft[frac{1}{n}sumlimits_{i=1}^n Y_iright] = Varleft[frac{1}{n}left(X_1+X_{n+1}+sumlimits_{i=2}^n 2X_iright)right]$ where the $X_i$s are independent







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',
    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%2f3062031%2flet-y-n-x-n-x-n1-and-t-n-frac1n-sum-i-1n-y-i-i-want-to-fi%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1














    Hints:




    • The $Y_i$s are not independent so you cannot just sum their variances


    • Consider $Var[T_n] = Varleft[frac{1}{n}sumlimits_{i=1}^n Y_iright] = Varleft[frac{1}{n}left(X_1+X_{n+1}+sumlimits_{i=2}^n 2X_iright)right]$ where the $X_i$s are independent







    share|cite|improve this answer


























      1














      Hints:




      • The $Y_i$s are not independent so you cannot just sum their variances


      • Consider $Var[T_n] = Varleft[frac{1}{n}sumlimits_{i=1}^n Y_iright] = Varleft[frac{1}{n}left(X_1+X_{n+1}+sumlimits_{i=2}^n 2X_iright)right]$ where the $X_i$s are independent







      share|cite|improve this answer
























        1












        1








        1






        Hints:




        • The $Y_i$s are not independent so you cannot just sum their variances


        • Consider $Var[T_n] = Varleft[frac{1}{n}sumlimits_{i=1}^n Y_iright] = Varleft[frac{1}{n}left(X_1+X_{n+1}+sumlimits_{i=2}^n 2X_iright)right]$ where the $X_i$s are independent







        share|cite|improve this answer












        Hints:




        • The $Y_i$s are not independent so you cannot just sum their variances


        • Consider $Var[T_n] = Varleft[frac{1}{n}sumlimits_{i=1}^n Y_iright] = Varleft[frac{1}{n}left(X_1+X_{n+1}+sumlimits_{i=2}^n 2X_iright)right]$ where the $X_i$s are independent








        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered yesterday









        Henry

        98.3k475162




        98.3k475162






























            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%2f3062031%2flet-y-n-x-n-x-n1-and-t-n-frac1n-sum-i-1n-y-i-i-want-to-fi%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

            Mario Kart Wii

            The Binding of Isaac: Rebirth/Afterbirth

            Dobbiaco