Generalized Polya's Urn












0












$begingroup$


In Polya's urn, we have $b$ black balls and $w$ white balls at time $t$. At time $t+1$, we have $b+1$ black balls with probability $frac{b}{w+b}$ and $w+1$ white balls with probability $frac{w}{w+b}$.



Is there a way to generalize the probability function? Can you construct a generalized Polya's urn such that the probability of $b+1$ black and $w+1$ white balls at $t+1$ is $f(b, w)$, where $f: {mathbb{N}^+}^2 rightarrow {0, 1}^2$?










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    In Polya's urn, we have $b$ black balls and $w$ white balls at time $t$. At time $t+1$, we have $b+1$ black balls with probability $frac{b}{w+b}$ and $w+1$ white balls with probability $frac{w}{w+b}$.



    Is there a way to generalize the probability function? Can you construct a generalized Polya's urn such that the probability of $b+1$ black and $w+1$ white balls at $t+1$ is $f(b, w)$, where $f: {mathbb{N}^+}^2 rightarrow {0, 1}^2$?










    share|cite|improve this question









    $endgroup$















      0












      0








      0


      1



      $begingroup$


      In Polya's urn, we have $b$ black balls and $w$ white balls at time $t$. At time $t+1$, we have $b+1$ black balls with probability $frac{b}{w+b}$ and $w+1$ white balls with probability $frac{w}{w+b}$.



      Is there a way to generalize the probability function? Can you construct a generalized Polya's urn such that the probability of $b+1$ black and $w+1$ white balls at $t+1$ is $f(b, w)$, where $f: {mathbb{N}^+}^2 rightarrow {0, 1}^2$?










      share|cite|improve this question









      $endgroup$




      In Polya's urn, we have $b$ black balls and $w$ white balls at time $t$. At time $t+1$, we have $b+1$ black balls with probability $frac{b}{w+b}$ and $w+1$ white balls with probability $frac{w}{w+b}$.



      Is there a way to generalize the probability function? Can you construct a generalized Polya's urn such that the probability of $b+1$ black and $w+1$ white balls at $t+1$ is $f(b, w)$, where $f: {mathbb{N}^+}^2 rightarrow {0, 1}^2$?







      probability statistics stochastic-processes random-variables random






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Dec 5 '18 at 23:57









      ux74bn1ux74bn1

      163




      163






















          1 Answer
          1






          active

          oldest

          votes


















          0












          $begingroup$

          It is possible to use any function $f:mathbb N^+ times mathbb N^+ to [0,1]$ to represent





          • $f(b,w)$ as the probability of moving from $b$ black balls and $w$ white balls to $b+1$ black balls and $w$ white balls


          • $1-f(b,w)$ as the probability of moving from $b$ black balls and $w$ white balls to $b$ black balls and $w+1$ white balls


          and given the starting position, then to find the distribution of the number or proportion of black balls or of white balls a given number of steps later. With the original Polya urn you have $f(b,w)=frac{b}{b+w}$ and $1-f(b,w)=frac{w}{b+w}$, but any other function can be used instead



          A further generalisation could be to allow transitions to other states, not just adding a single ball with each step, or to have more than two colours, though these might require a more complicated function or a switch to a Markov-chain type of analysis






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            What if you also generalize the updating of the number of balls at each round? Rather than increment by 1, you use a function g() which takes in the number of balls of each color at $t$, and outputs the number at $t+1$.
            $endgroup$
            – ux74bn1
            Dec 6 '18 at 16:10










          • $begingroup$
            @ux74bn1 - Yes, though you might then find a Markov chain a more useful approach
            $endgroup$
            – Henry
            Dec 6 '18 at 19:34











          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%2f3027847%2fgeneralized-polyas-urn%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









          0












          $begingroup$

          It is possible to use any function $f:mathbb N^+ times mathbb N^+ to [0,1]$ to represent





          • $f(b,w)$ as the probability of moving from $b$ black balls and $w$ white balls to $b+1$ black balls and $w$ white balls


          • $1-f(b,w)$ as the probability of moving from $b$ black balls and $w$ white balls to $b$ black balls and $w+1$ white balls


          and given the starting position, then to find the distribution of the number or proportion of black balls or of white balls a given number of steps later. With the original Polya urn you have $f(b,w)=frac{b}{b+w}$ and $1-f(b,w)=frac{w}{b+w}$, but any other function can be used instead



          A further generalisation could be to allow transitions to other states, not just adding a single ball with each step, or to have more than two colours, though these might require a more complicated function or a switch to a Markov-chain type of analysis






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            What if you also generalize the updating of the number of balls at each round? Rather than increment by 1, you use a function g() which takes in the number of balls of each color at $t$, and outputs the number at $t+1$.
            $endgroup$
            – ux74bn1
            Dec 6 '18 at 16:10










          • $begingroup$
            @ux74bn1 - Yes, though you might then find a Markov chain a more useful approach
            $endgroup$
            – Henry
            Dec 6 '18 at 19:34
















          0












          $begingroup$

          It is possible to use any function $f:mathbb N^+ times mathbb N^+ to [0,1]$ to represent





          • $f(b,w)$ as the probability of moving from $b$ black balls and $w$ white balls to $b+1$ black balls and $w$ white balls


          • $1-f(b,w)$ as the probability of moving from $b$ black balls and $w$ white balls to $b$ black balls and $w+1$ white balls


          and given the starting position, then to find the distribution of the number or proportion of black balls or of white balls a given number of steps later. With the original Polya urn you have $f(b,w)=frac{b}{b+w}$ and $1-f(b,w)=frac{w}{b+w}$, but any other function can be used instead



          A further generalisation could be to allow transitions to other states, not just adding a single ball with each step, or to have more than two colours, though these might require a more complicated function or a switch to a Markov-chain type of analysis






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            What if you also generalize the updating of the number of balls at each round? Rather than increment by 1, you use a function g() which takes in the number of balls of each color at $t$, and outputs the number at $t+1$.
            $endgroup$
            – ux74bn1
            Dec 6 '18 at 16:10










          • $begingroup$
            @ux74bn1 - Yes, though you might then find a Markov chain a more useful approach
            $endgroup$
            – Henry
            Dec 6 '18 at 19:34














          0












          0








          0





          $begingroup$

          It is possible to use any function $f:mathbb N^+ times mathbb N^+ to [0,1]$ to represent





          • $f(b,w)$ as the probability of moving from $b$ black balls and $w$ white balls to $b+1$ black balls and $w$ white balls


          • $1-f(b,w)$ as the probability of moving from $b$ black balls and $w$ white balls to $b$ black balls and $w+1$ white balls


          and given the starting position, then to find the distribution of the number or proportion of black balls or of white balls a given number of steps later. With the original Polya urn you have $f(b,w)=frac{b}{b+w}$ and $1-f(b,w)=frac{w}{b+w}$, but any other function can be used instead



          A further generalisation could be to allow transitions to other states, not just adding a single ball with each step, or to have more than two colours, though these might require a more complicated function or a switch to a Markov-chain type of analysis






          share|cite|improve this answer









          $endgroup$



          It is possible to use any function $f:mathbb N^+ times mathbb N^+ to [0,1]$ to represent





          • $f(b,w)$ as the probability of moving from $b$ black balls and $w$ white balls to $b+1$ black balls and $w$ white balls


          • $1-f(b,w)$ as the probability of moving from $b$ black balls and $w$ white balls to $b$ black balls and $w+1$ white balls


          and given the starting position, then to find the distribution of the number or proportion of black balls or of white balls a given number of steps later. With the original Polya urn you have $f(b,w)=frac{b}{b+w}$ and $1-f(b,w)=frac{w}{b+w}$, but any other function can be used instead



          A further generalisation could be to allow transitions to other states, not just adding a single ball with each step, or to have more than two colours, though these might require a more complicated function or a switch to a Markov-chain type of analysis







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 6 '18 at 12:02









          HenryHenry

          98.5k476163




          98.5k476163












          • $begingroup$
            What if you also generalize the updating of the number of balls at each round? Rather than increment by 1, you use a function g() which takes in the number of balls of each color at $t$, and outputs the number at $t+1$.
            $endgroup$
            – ux74bn1
            Dec 6 '18 at 16:10










          • $begingroup$
            @ux74bn1 - Yes, though you might then find a Markov chain a more useful approach
            $endgroup$
            – Henry
            Dec 6 '18 at 19:34


















          • $begingroup$
            What if you also generalize the updating of the number of balls at each round? Rather than increment by 1, you use a function g() which takes in the number of balls of each color at $t$, and outputs the number at $t+1$.
            $endgroup$
            – ux74bn1
            Dec 6 '18 at 16:10










          • $begingroup$
            @ux74bn1 - Yes, though you might then find a Markov chain a more useful approach
            $endgroup$
            – Henry
            Dec 6 '18 at 19:34
















          $begingroup$
          What if you also generalize the updating of the number of balls at each round? Rather than increment by 1, you use a function g() which takes in the number of balls of each color at $t$, and outputs the number at $t+1$.
          $endgroup$
          – ux74bn1
          Dec 6 '18 at 16:10




          $begingroup$
          What if you also generalize the updating of the number of balls at each round? Rather than increment by 1, you use a function g() which takes in the number of balls of each color at $t$, and outputs the number at $t+1$.
          $endgroup$
          – ux74bn1
          Dec 6 '18 at 16:10












          $begingroup$
          @ux74bn1 - Yes, though you might then find a Markov chain a more useful approach
          $endgroup$
          – Henry
          Dec 6 '18 at 19:34




          $begingroup$
          @ux74bn1 - Yes, though you might then find a Markov chain a more useful approach
          $endgroup$
          – Henry
          Dec 6 '18 at 19:34


















          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%2f3027847%2fgeneralized-polyas-urn%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

          Berounka

          Fiat S.p.A.

          Type 'String' is not a subtype of type 'int' of 'index'