Computing the expectation of the number of balls in a box The 2019 Stack Overflow Developer Survey Results Are InThere is two boxes with one with 8 balls and one with 4 ballsdrawing balls from box without replacemntRandom distribution of colored balls into boxes.Optimal Number of White BallsCompute possible outcomes when get balls from a boxPoisson Approximation Problem involving putting balls into boxesCompute expected received balls from boxesput n balls into n boxesA question of probability regarding expectation and variance of a random variable.Distributing 5 distinct balls into 3 distinct boxes

What is the light source in the black hole images?

How to translate "being like"?

Did the UK government pay "millions and millions of dollars" to try to snag Julian Assange?

Inverse Relationship Between Precision and Recall

I am an eight letter word. What am I?

Can a rogue use sneak attack with weapons that have the thrown property even if they are not thrown?

What information about me do stores get via my credit card?

When should I buy a clipper card after flying to Oakland?

How do I free up internal storage if I don't have any apps downloaded?

How come people say “Would of”?

What could be the right powersource for 15 seconds lifespan disposable giant chainsaw?

Relationship between Gromov-Witten and Taubes' Gromov invariant

What is the meaning of Triage in Cybersec world?

Why doesn't UInt have a toDouble()?

Match Roman Numerals

How to charge AirPods to keep battery healthy?

How to obtain a position of last non-zero element

How to display lines in a file like ls displays files in a directory?

Why was M87 targeted for the Event Horizon Telescope instead of Sagittarius A*?

Can a flute soloist sit?

Is it ok to offer lower paid work as a trial period before negotiating for a full-time job?

Does HR tell a hiring manager about salary negotiations?

Is Cinnamon a desktop environment or a window manager? (Or both?)

Is it okay to consider publishing in my first year of PhD?



Computing the expectation of the number of balls in a box



The 2019 Stack Overflow Developer Survey Results Are InThere is two boxes with one with 8 balls and one with 4 ballsdrawing balls from box without replacemntRandom distribution of colored balls into boxes.Optimal Number of White BallsCompute possible outcomes when get balls from a boxPoisson Approximation Problem involving putting balls into boxesCompute expected received balls from boxesput n balls into n boxesA question of probability regarding expectation and variance of a random variable.Distributing 5 distinct balls into 3 distinct boxes










5












$begingroup$


  • There are $r$ boxes and $n$ balls.

  • Each ball is placed in a box with equal probability, independently of the other balls.

  • Let $X_i$ be the number of balls in box $i$,
    $1 leq i leq r$.

  • Compute $mathbbEleft[X_iright], mathbbEleft[X_iX_jright]$.

I am preparing for an exam, and I have no idea how to approach this problem. Can someone push me in the right direction ?.










share|cite|improve this question











$endgroup$











  • $begingroup$
    Are there any restrictions on $j$?
    $endgroup$
    – Sean Lee
    4 hours ago










  • $begingroup$
    @SeanLee In the question, no. I'm guessing it would have the same restrictions as i.
    $endgroup$
    – 631
    4 hours ago










  • $begingroup$
    Computationally, the answer to the second part appears to be $fracn^2r^2$
    $endgroup$
    – Sean Lee
    3 hours ago















5












$begingroup$


  • There are $r$ boxes and $n$ balls.

  • Each ball is placed in a box with equal probability, independently of the other balls.

  • Let $X_i$ be the number of balls in box $i$,
    $1 leq i leq r$.

  • Compute $mathbbEleft[X_iright], mathbbEleft[X_iX_jright]$.

I am preparing for an exam, and I have no idea how to approach this problem. Can someone push me in the right direction ?.










share|cite|improve this question











$endgroup$











  • $begingroup$
    Are there any restrictions on $j$?
    $endgroup$
    – Sean Lee
    4 hours ago










  • $begingroup$
    @SeanLee In the question, no. I'm guessing it would have the same restrictions as i.
    $endgroup$
    – 631
    4 hours ago










  • $begingroup$
    Computationally, the answer to the second part appears to be $fracn^2r^2$
    $endgroup$
    – Sean Lee
    3 hours ago













5












5








5





$begingroup$


  • There are $r$ boxes and $n$ balls.

  • Each ball is placed in a box with equal probability, independently of the other balls.

  • Let $X_i$ be the number of balls in box $i$,
    $1 leq i leq r$.

  • Compute $mathbbEleft[X_iright], mathbbEleft[X_iX_jright]$.

I am preparing for an exam, and I have no idea how to approach this problem. Can someone push me in the right direction ?.










share|cite|improve this question











$endgroup$




  • There are $r$ boxes and $n$ balls.

  • Each ball is placed in a box with equal probability, independently of the other balls.

  • Let $X_i$ be the number of balls in box $i$,
    $1 leq i leq r$.

  • Compute $mathbbEleft[X_iright], mathbbEleft[X_iX_jright]$.

I am preparing for an exam, and I have no idea how to approach this problem. Can someone push me in the right direction ?.







probability-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 4 hours ago









Felix Marin

68.9k7110147




68.9k7110147










asked 4 hours ago









631631

585




585











  • $begingroup$
    Are there any restrictions on $j$?
    $endgroup$
    – Sean Lee
    4 hours ago










  • $begingroup$
    @SeanLee In the question, no. I'm guessing it would have the same restrictions as i.
    $endgroup$
    – 631
    4 hours ago










  • $begingroup$
    Computationally, the answer to the second part appears to be $fracn^2r^2$
    $endgroup$
    – Sean Lee
    3 hours ago
















  • $begingroup$
    Are there any restrictions on $j$?
    $endgroup$
    – Sean Lee
    4 hours ago










  • $begingroup$
    @SeanLee In the question, no. I'm guessing it would have the same restrictions as i.
    $endgroup$
    – 631
    4 hours ago










  • $begingroup$
    Computationally, the answer to the second part appears to be $fracn^2r^2$
    $endgroup$
    – Sean Lee
    3 hours ago















$begingroup$
Are there any restrictions on $j$?
$endgroup$
– Sean Lee
4 hours ago




$begingroup$
Are there any restrictions on $j$?
$endgroup$
– Sean Lee
4 hours ago












$begingroup$
@SeanLee In the question, no. I'm guessing it would have the same restrictions as i.
$endgroup$
– 631
4 hours ago




$begingroup$
@SeanLee In the question, no. I'm guessing it would have the same restrictions as i.
$endgroup$
– 631
4 hours ago












$begingroup$
Computationally, the answer to the second part appears to be $fracn^2r^2$
$endgroup$
– Sean Lee
3 hours ago




$begingroup$
Computationally, the answer to the second part appears to be $fracn^2r^2$
$endgroup$
– Sean Lee
3 hours ago










3 Answers
3






active

oldest

votes


















2












$begingroup$

Since there are $r$ boxes and $n$ balls, and each ball is placed in a box with equal probability, we have:



$$ mathbbE[X_i] = fracnr $$



Now, we would like to know what is $mathbbE[X_i X_j] $.



We begin by making the following observation:



$$X_i = n - sum_jneq iX_j $$



Which gives us:



$$ X_isum_jneq iX_j = nX_i - X_i^2$$



Now, fix $i$ (we can do this because of the symmetry in the question), and thus we have:



beginalignmathbbE[X_i X_j] &= frac1rBig(mathbbE[X_i sum_jneq i X_j] + mathbbE[X_i^2]Big) \
&= frac1r mathbbE[nX_i] \
&= fracn^2r^2
endalign






share|cite|improve this answer











$endgroup$




















    3












    $begingroup$

    For the first part, you can use linearity of expectation to compute $mathbbE[X_i]$.
    Specifically, you know that for a fixed box, the probability of putting a ball in it
    is $frac1r$. Let



    $$
    Y_k^(i) = begincases
    1 &, text if ball $k$ was placed in box $i$ \
    0 &, text otherwise
    endcases,
    $$

    which satisfies $mathbbE[Y_k^(i)] = mathbbP(Y_k^(i) = 1) = frac1r.$
    Then you can write



    $$
    X_i = sum_j=1^n Y_j^(i) Rightarrow mathbbEX_i = sum_j=1^n frac1r = fracnr.
    $$






    share|cite|improve this answer









    $endgroup$




















      0












      $begingroup$

      Think of placing the ball in box "$i$" as success and not placing it as a failure.



      This situation can be represented using the Hypergeometric Distribution.
      $$
      P(X=k) = fracK choose k N- Kchoose n - kN choose n.
      $$



      $N$ is the population size (number of boxes $r$)



      $K$ is the number of success states in the population (just $1$ because the success is defined as placing the ball in box "$i$".)



      $n$ is the number of draws (the number of balls $n$).



      $k$ is the number of observed successes (the number of balls in box "$i$").



      The expectation of the Hypergeometric Distribution is $nfracKN$, hence the mean of your variable
      $$E[X_i]=nfrac1r=fracnr$$






      share|cite|improve this answer









      $endgroup$













        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%2f3184022%2fcomputing-the-expectation-of-the-number-of-balls-in-a-box%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









        2












        $begingroup$

        Since there are $r$ boxes and $n$ balls, and each ball is placed in a box with equal probability, we have:



        $$ mathbbE[X_i] = fracnr $$



        Now, we would like to know what is $mathbbE[X_i X_j] $.



        We begin by making the following observation:



        $$X_i = n - sum_jneq iX_j $$



        Which gives us:



        $$ X_isum_jneq iX_j = nX_i - X_i^2$$



        Now, fix $i$ (we can do this because of the symmetry in the question), and thus we have:



        beginalignmathbbE[X_i X_j] &= frac1rBig(mathbbE[X_i sum_jneq i X_j] + mathbbE[X_i^2]Big) \
        &= frac1r mathbbE[nX_i] \
        &= fracn^2r^2
        endalign






        share|cite|improve this answer











        $endgroup$

















          2












          $begingroup$

          Since there are $r$ boxes and $n$ balls, and each ball is placed in a box with equal probability, we have:



          $$ mathbbE[X_i] = fracnr $$



          Now, we would like to know what is $mathbbE[X_i X_j] $.



          We begin by making the following observation:



          $$X_i = n - sum_jneq iX_j $$



          Which gives us:



          $$ X_isum_jneq iX_j = nX_i - X_i^2$$



          Now, fix $i$ (we can do this because of the symmetry in the question), and thus we have:



          beginalignmathbbE[X_i X_j] &= frac1rBig(mathbbE[X_i sum_jneq i X_j] + mathbbE[X_i^2]Big) \
          &= frac1r mathbbE[nX_i] \
          &= fracn^2r^2
          endalign






          share|cite|improve this answer











          $endgroup$















            2












            2








            2





            $begingroup$

            Since there are $r$ boxes and $n$ balls, and each ball is placed in a box with equal probability, we have:



            $$ mathbbE[X_i] = fracnr $$



            Now, we would like to know what is $mathbbE[X_i X_j] $.



            We begin by making the following observation:



            $$X_i = n - sum_jneq iX_j $$



            Which gives us:



            $$ X_isum_jneq iX_j = nX_i - X_i^2$$



            Now, fix $i$ (we can do this because of the symmetry in the question), and thus we have:



            beginalignmathbbE[X_i X_j] &= frac1rBig(mathbbE[X_i sum_jneq i X_j] + mathbbE[X_i^2]Big) \
            &= frac1r mathbbE[nX_i] \
            &= fracn^2r^2
            endalign






            share|cite|improve this answer











            $endgroup$



            Since there are $r$ boxes and $n$ balls, and each ball is placed in a box with equal probability, we have:



            $$ mathbbE[X_i] = fracnr $$



            Now, we would like to know what is $mathbbE[X_i X_j] $.



            We begin by making the following observation:



            $$X_i = n - sum_jneq iX_j $$



            Which gives us:



            $$ X_isum_jneq iX_j = nX_i - X_i^2$$



            Now, fix $i$ (we can do this because of the symmetry in the question), and thus we have:



            beginalignmathbbE[X_i X_j] &= frac1rBig(mathbbE[X_i sum_jneq i X_j] + mathbbE[X_i^2]Big) \
            &= frac1r mathbbE[nX_i] \
            &= fracn^2r^2
            endalign







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited 3 hours ago

























            answered 3 hours ago









            Sean LeeSean Lee

            801214




            801214





















                3












                $begingroup$

                For the first part, you can use linearity of expectation to compute $mathbbE[X_i]$.
                Specifically, you know that for a fixed box, the probability of putting a ball in it
                is $frac1r$. Let



                $$
                Y_k^(i) = begincases
                1 &, text if ball $k$ was placed in box $i$ \
                0 &, text otherwise
                endcases,
                $$

                which satisfies $mathbbE[Y_k^(i)] = mathbbP(Y_k^(i) = 1) = frac1r.$
                Then you can write



                $$
                X_i = sum_j=1^n Y_j^(i) Rightarrow mathbbEX_i = sum_j=1^n frac1r = fracnr.
                $$






                share|cite|improve this answer









                $endgroup$

















                  3












                  $begingroup$

                  For the first part, you can use linearity of expectation to compute $mathbbE[X_i]$.
                  Specifically, you know that for a fixed box, the probability of putting a ball in it
                  is $frac1r$. Let



                  $$
                  Y_k^(i) = begincases
                  1 &, text if ball $k$ was placed in box $i$ \
                  0 &, text otherwise
                  endcases,
                  $$

                  which satisfies $mathbbE[Y_k^(i)] = mathbbP(Y_k^(i) = 1) = frac1r.$
                  Then you can write



                  $$
                  X_i = sum_j=1^n Y_j^(i) Rightarrow mathbbEX_i = sum_j=1^n frac1r = fracnr.
                  $$






                  share|cite|improve this answer









                  $endgroup$















                    3












                    3








                    3





                    $begingroup$

                    For the first part, you can use linearity of expectation to compute $mathbbE[X_i]$.
                    Specifically, you know that for a fixed box, the probability of putting a ball in it
                    is $frac1r$. Let



                    $$
                    Y_k^(i) = begincases
                    1 &, text if ball $k$ was placed in box $i$ \
                    0 &, text otherwise
                    endcases,
                    $$

                    which satisfies $mathbbE[Y_k^(i)] = mathbbP(Y_k^(i) = 1) = frac1r.$
                    Then you can write



                    $$
                    X_i = sum_j=1^n Y_j^(i) Rightarrow mathbbEX_i = sum_j=1^n frac1r = fracnr.
                    $$






                    share|cite|improve this answer









                    $endgroup$



                    For the first part, you can use linearity of expectation to compute $mathbbE[X_i]$.
                    Specifically, you know that for a fixed box, the probability of putting a ball in it
                    is $frac1r$. Let



                    $$
                    Y_k^(i) = begincases
                    1 &, text if ball $k$ was placed in box $i$ \
                    0 &, text otherwise
                    endcases,
                    $$

                    which satisfies $mathbbE[Y_k^(i)] = mathbbP(Y_k^(i) = 1) = frac1r.$
                    Then you can write



                    $$
                    X_i = sum_j=1^n Y_j^(i) Rightarrow mathbbEX_i = sum_j=1^n frac1r = fracnr.
                    $$







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered 4 hours ago









                    VHarisopVHarisop

                    1,218421




                    1,218421





















                        0












                        $begingroup$

                        Think of placing the ball in box "$i$" as success and not placing it as a failure.



                        This situation can be represented using the Hypergeometric Distribution.
                        $$
                        P(X=k) = fracK choose k N- Kchoose n - kN choose n.
                        $$



                        $N$ is the population size (number of boxes $r$)



                        $K$ is the number of success states in the population (just $1$ because the success is defined as placing the ball in box "$i$".)



                        $n$ is the number of draws (the number of balls $n$).



                        $k$ is the number of observed successes (the number of balls in box "$i$").



                        The expectation of the Hypergeometric Distribution is $nfracKN$, hence the mean of your variable
                        $$E[X_i]=nfrac1r=fracnr$$






                        share|cite|improve this answer









                        $endgroup$

















                          0












                          $begingroup$

                          Think of placing the ball in box "$i$" as success and not placing it as a failure.



                          This situation can be represented using the Hypergeometric Distribution.
                          $$
                          P(X=k) = fracK choose k N- Kchoose n - kN choose n.
                          $$



                          $N$ is the population size (number of boxes $r$)



                          $K$ is the number of success states in the population (just $1$ because the success is defined as placing the ball in box "$i$".)



                          $n$ is the number of draws (the number of balls $n$).



                          $k$ is the number of observed successes (the number of balls in box "$i$").



                          The expectation of the Hypergeometric Distribution is $nfracKN$, hence the mean of your variable
                          $$E[X_i]=nfrac1r=fracnr$$






                          share|cite|improve this answer









                          $endgroup$















                            0












                            0








                            0





                            $begingroup$

                            Think of placing the ball in box "$i$" as success and not placing it as a failure.



                            This situation can be represented using the Hypergeometric Distribution.
                            $$
                            P(X=k) = fracK choose k N- Kchoose n - kN choose n.
                            $$



                            $N$ is the population size (number of boxes $r$)



                            $K$ is the number of success states in the population (just $1$ because the success is defined as placing the ball in box "$i$".)



                            $n$ is the number of draws (the number of balls $n$).



                            $k$ is the number of observed successes (the number of balls in box "$i$").



                            The expectation of the Hypergeometric Distribution is $nfracKN$, hence the mean of your variable
                            $$E[X_i]=nfrac1r=fracnr$$






                            share|cite|improve this answer









                            $endgroup$



                            Think of placing the ball in box "$i$" as success and not placing it as a failure.



                            This situation can be represented using the Hypergeometric Distribution.
                            $$
                            P(X=k) = fracK choose k N- Kchoose n - kN choose n.
                            $$



                            $N$ is the population size (number of boxes $r$)



                            $K$ is the number of success states in the population (just $1$ because the success is defined as placing the ball in box "$i$".)



                            $n$ is the number of draws (the number of balls $n$).



                            $k$ is the number of observed successes (the number of balls in box "$i$").



                            The expectation of the Hypergeometric Distribution is $nfracKN$, hence the mean of your variable
                            $$E[X_i]=nfrac1r=fracnr$$







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered 3 hours ago









                            RScrlliRScrlli

                            761114




                            761114



























                                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%2f3184022%2fcomputing-the-expectation-of-the-number-of-balls-in-a-box%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

                                Sahara Skak | Bilen | Luke uk diar | NawigatsjuunCommonskategorii: SaharaWikivoyage raisfeerer: Sahara26° N, 13° O

                                The fall designs the understood secretary. Looking glass Science Shock Discovery Hot Everybody Loves Raymond Smile 곳 서비스 성실하다 Defas Kaloolon Definition: To combine or impregnate with sulphur or any of its compounds as to sulphurize caoutchouc in vulcanizing Flame colored Reason Useful Thin Help 갖다 유명하다 낙엽 장례식 Country Iron Definition: A fencer a gladiator one who exhibits his skill in the use of the sword Definition: The American black throated bunting Spiza Americana Nostalgic Needy Method to my madness 시키다 평가되다 전부 소설가 우아하다 Argument Tin Feeling Representative Gym Music Gaur Chicken 일쑤 코치 편 학생증 The harbor values the sugar. Vasagle Yammoe Enstatite Definition: Capable of being limited Road Neighborly Five Refer Built Kangaroo 비비다 Degree Release Bargain Horse 하루 형님 유교 석 동부 괴롭히다 경제력

                                19. јануар Садржај Догађаји Рођења Смрти Празници и дани сећања Види још Референце Мени за навигацијуу