Is Gibbs sampling an MCMC method?





.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty{ margin-bottom:0;
}






up vote
8
down vote

favorite
2












As far as I understand it, it is (at least, that is how Wikipedia defines it). But I've found this statement by Efron* (emphasis added):




Markov chain Monte Carlo (MCMC) is the great success story of modern-day Bayesian statistics. MCMC, and its sister method “Gibbs sampling,” permit the numerical calculation of posterior distributions in situations far too complicated for analytic expression.




and now I'm confused. Is this just a minor difference in terminology, or is Gibbs sampling something other than MCMC?



[*]: Efron 2011, "The Bootstrap and Markov-Chain Monte Carlo"










share|cite|improve this question




























    up vote
    8
    down vote

    favorite
    2












    As far as I understand it, it is (at least, that is how Wikipedia defines it). But I've found this statement by Efron* (emphasis added):




    Markov chain Monte Carlo (MCMC) is the great success story of modern-day Bayesian statistics. MCMC, and its sister method “Gibbs sampling,” permit the numerical calculation of posterior distributions in situations far too complicated for analytic expression.




    and now I'm confused. Is this just a minor difference in terminology, or is Gibbs sampling something other than MCMC?



    [*]: Efron 2011, "The Bootstrap and Markov-Chain Monte Carlo"










    share|cite|improve this question
























      up vote
      8
      down vote

      favorite
      2









      up vote
      8
      down vote

      favorite
      2






      2





      As far as I understand it, it is (at least, that is how Wikipedia defines it). But I've found this statement by Efron* (emphasis added):




      Markov chain Monte Carlo (MCMC) is the great success story of modern-day Bayesian statistics. MCMC, and its sister method “Gibbs sampling,” permit the numerical calculation of posterior distributions in situations far too complicated for analytic expression.




      and now I'm confused. Is this just a minor difference in terminology, or is Gibbs sampling something other than MCMC?



      [*]: Efron 2011, "The Bootstrap and Markov-Chain Monte Carlo"










      share|cite|improve this question













      As far as I understand it, it is (at least, that is how Wikipedia defines it). But I've found this statement by Efron* (emphasis added):




      Markov chain Monte Carlo (MCMC) is the great success story of modern-day Bayesian statistics. MCMC, and its sister method “Gibbs sampling,” permit the numerical calculation of posterior distributions in situations far too complicated for analytic expression.




      and now I'm confused. Is this just a minor difference in terminology, or is Gibbs sampling something other than MCMC?



      [*]: Efron 2011, "The Bootstrap and Markov-Chain Monte Carlo"







      mcmc gibbs






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 29 at 21:52









      Gabriel

      1,0501234




      1,0501234






















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          10
          down vote



          accepted










          The algorithm that is now called Gibbs sampling forms a Markov-chain and uses Monte-Carlo simulation for its inputs, so it does indeed fall within the proper scope of MCMC (Markov-Chain Monte-Carlo) methods. Historically, the method can be traced back at least to the mid-twentieth century, but it was not well-known and was only later popularised by the seminal paper of Geman and Geman (1984) which examined statistical physics in relation to the use of the Gibbs distribution (for some historical references, see Casella and George 1992, p. 167).



          For some reason, thoughout his paper, Efron refers to the Gibbs sampler as if it were outside the scope of MCMC. He does this in the quote you have given, and also in some other parts of the paper. Since his opening reference to the technique refers to the "Gibbs sampler" (given in quotes) it is possible that he is alluding to the historical fact that the original method was developed through the Gibbs distribution in statistical physics, and was not incorporated into the general statistical theory of MCMC until much later. This is my best guess as to why he refers to it this way.



          Update: Since Prof Efron is still alive I took the liberty of writing to him to ask why he describes the Gibbs sampler in this way. Here is his response (reproduced with his permission):




          It was for mainly historical reasons... On the other hand, the Gibbs algorithm looks quite different from the MCMC recipe, and it takes some work to show that it is in some sense the same.
          (Efron 2018, personal correspondence, ellipsis in original)







          share|cite|improve this answer



















          • 1




            Thank you! I'll wait to see if you get an answer from Dr Efron, if not I'll still select this as the answer.
            – Gabriel
            Nov 30 at 3:09


















          up vote
          2
          down vote













          Go with Wikipedia. Better yet, go with these MCMC researchers:





          • Tierney (1994), "Markov Chains for Exploring Posterior Distributions";


          • Geyer (2011), "Introduction to Markov Chain Monte Carlo";


          • Robert and Casella (2011), "A Short History of Markov Chain Monte Carlo".


          The Gibbs sampler is an example of a Markov chain Monte Carlo algorithm. Indeed, it is a special case of the Metropolis-Hastings algorithm. Any algorithm that generates random draws from a distribution $pi(theta)$ by simulating a Markov chain that has $pi(theta)$ as its stationary distribution is a Markov chain Monte Carlo algorithm, and that's exactly what the Gibbs sampler does.






          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: "65"
            };
            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: false,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: null,
            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
            },
            onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            });


            }
            });














            draft saved

            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstats.stackexchange.com%2fquestions%2f379508%2fis-gibbs-sampling-an-mcmc-method%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            2 Answers
            2






            active

            oldest

            votes








            2 Answers
            2






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes








            up vote
            10
            down vote



            accepted










            The algorithm that is now called Gibbs sampling forms a Markov-chain and uses Monte-Carlo simulation for its inputs, so it does indeed fall within the proper scope of MCMC (Markov-Chain Monte-Carlo) methods. Historically, the method can be traced back at least to the mid-twentieth century, but it was not well-known and was only later popularised by the seminal paper of Geman and Geman (1984) which examined statistical physics in relation to the use of the Gibbs distribution (for some historical references, see Casella and George 1992, p. 167).



            For some reason, thoughout his paper, Efron refers to the Gibbs sampler as if it were outside the scope of MCMC. He does this in the quote you have given, and also in some other parts of the paper. Since his opening reference to the technique refers to the "Gibbs sampler" (given in quotes) it is possible that he is alluding to the historical fact that the original method was developed through the Gibbs distribution in statistical physics, and was not incorporated into the general statistical theory of MCMC until much later. This is my best guess as to why he refers to it this way.



            Update: Since Prof Efron is still alive I took the liberty of writing to him to ask why he describes the Gibbs sampler in this way. Here is his response (reproduced with his permission):




            It was for mainly historical reasons... On the other hand, the Gibbs algorithm looks quite different from the MCMC recipe, and it takes some work to show that it is in some sense the same.
            (Efron 2018, personal correspondence, ellipsis in original)







            share|cite|improve this answer



















            • 1




              Thank you! I'll wait to see if you get an answer from Dr Efron, if not I'll still select this as the answer.
              – Gabriel
              Nov 30 at 3:09















            up vote
            10
            down vote



            accepted










            The algorithm that is now called Gibbs sampling forms a Markov-chain and uses Monte-Carlo simulation for its inputs, so it does indeed fall within the proper scope of MCMC (Markov-Chain Monte-Carlo) methods. Historically, the method can be traced back at least to the mid-twentieth century, but it was not well-known and was only later popularised by the seminal paper of Geman and Geman (1984) which examined statistical physics in relation to the use of the Gibbs distribution (for some historical references, see Casella and George 1992, p. 167).



            For some reason, thoughout his paper, Efron refers to the Gibbs sampler as if it were outside the scope of MCMC. He does this in the quote you have given, and also in some other parts of the paper. Since his opening reference to the technique refers to the "Gibbs sampler" (given in quotes) it is possible that he is alluding to the historical fact that the original method was developed through the Gibbs distribution in statistical physics, and was not incorporated into the general statistical theory of MCMC until much later. This is my best guess as to why he refers to it this way.



            Update: Since Prof Efron is still alive I took the liberty of writing to him to ask why he describes the Gibbs sampler in this way. Here is his response (reproduced with his permission):




            It was for mainly historical reasons... On the other hand, the Gibbs algorithm looks quite different from the MCMC recipe, and it takes some work to show that it is in some sense the same.
            (Efron 2018, personal correspondence, ellipsis in original)







            share|cite|improve this answer



















            • 1




              Thank you! I'll wait to see if you get an answer from Dr Efron, if not I'll still select this as the answer.
              – Gabriel
              Nov 30 at 3:09













            up vote
            10
            down vote



            accepted







            up vote
            10
            down vote



            accepted






            The algorithm that is now called Gibbs sampling forms a Markov-chain and uses Monte-Carlo simulation for its inputs, so it does indeed fall within the proper scope of MCMC (Markov-Chain Monte-Carlo) methods. Historically, the method can be traced back at least to the mid-twentieth century, but it was not well-known and was only later popularised by the seminal paper of Geman and Geman (1984) which examined statistical physics in relation to the use of the Gibbs distribution (for some historical references, see Casella and George 1992, p. 167).



            For some reason, thoughout his paper, Efron refers to the Gibbs sampler as if it were outside the scope of MCMC. He does this in the quote you have given, and also in some other parts of the paper. Since his opening reference to the technique refers to the "Gibbs sampler" (given in quotes) it is possible that he is alluding to the historical fact that the original method was developed through the Gibbs distribution in statistical physics, and was not incorporated into the general statistical theory of MCMC until much later. This is my best guess as to why he refers to it this way.



            Update: Since Prof Efron is still alive I took the liberty of writing to him to ask why he describes the Gibbs sampler in this way. Here is his response (reproduced with his permission):




            It was for mainly historical reasons... On the other hand, the Gibbs algorithm looks quite different from the MCMC recipe, and it takes some work to show that it is in some sense the same.
            (Efron 2018, personal correspondence, ellipsis in original)







            share|cite|improve this answer














            The algorithm that is now called Gibbs sampling forms a Markov-chain and uses Monte-Carlo simulation for its inputs, so it does indeed fall within the proper scope of MCMC (Markov-Chain Monte-Carlo) methods. Historically, the method can be traced back at least to the mid-twentieth century, but it was not well-known and was only later popularised by the seminal paper of Geman and Geman (1984) which examined statistical physics in relation to the use of the Gibbs distribution (for some historical references, see Casella and George 1992, p. 167).



            For some reason, thoughout his paper, Efron refers to the Gibbs sampler as if it were outside the scope of MCMC. He does this in the quote you have given, and also in some other parts of the paper. Since his opening reference to the technique refers to the "Gibbs sampler" (given in quotes) it is possible that he is alluding to the historical fact that the original method was developed through the Gibbs distribution in statistical physics, and was not incorporated into the general statistical theory of MCMC until much later. This is my best guess as to why he refers to it this way.



            Update: Since Prof Efron is still alive I took the liberty of writing to him to ask why he describes the Gibbs sampler in this way. Here is his response (reproduced with his permission):




            It was for mainly historical reasons... On the other hand, the Gibbs algorithm looks quite different from the MCMC recipe, and it takes some work to show that it is in some sense the same.
            (Efron 2018, personal correspondence, ellipsis in original)








            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited 19 hours ago

























            answered Nov 30 at 2:14









            Ben

            19.8k22296




            19.8k22296








            • 1




              Thank you! I'll wait to see if you get an answer from Dr Efron, if not I'll still select this as the answer.
              – Gabriel
              Nov 30 at 3:09














            • 1




              Thank you! I'll wait to see if you get an answer from Dr Efron, if not I'll still select this as the answer.
              – Gabriel
              Nov 30 at 3:09








            1




            1




            Thank you! I'll wait to see if you get an answer from Dr Efron, if not I'll still select this as the answer.
            – Gabriel
            Nov 30 at 3:09




            Thank you! I'll wait to see if you get an answer from Dr Efron, if not I'll still select this as the answer.
            – Gabriel
            Nov 30 at 3:09












            up vote
            2
            down vote













            Go with Wikipedia. Better yet, go with these MCMC researchers:





            • Tierney (1994), "Markov Chains for Exploring Posterior Distributions";


            • Geyer (2011), "Introduction to Markov Chain Monte Carlo";


            • Robert and Casella (2011), "A Short History of Markov Chain Monte Carlo".


            The Gibbs sampler is an example of a Markov chain Monte Carlo algorithm. Indeed, it is a special case of the Metropolis-Hastings algorithm. Any algorithm that generates random draws from a distribution $pi(theta)$ by simulating a Markov chain that has $pi(theta)$ as its stationary distribution is a Markov chain Monte Carlo algorithm, and that's exactly what the Gibbs sampler does.






            share|cite|improve this answer



























              up vote
              2
              down vote













              Go with Wikipedia. Better yet, go with these MCMC researchers:





              • Tierney (1994), "Markov Chains for Exploring Posterior Distributions";


              • Geyer (2011), "Introduction to Markov Chain Monte Carlo";


              • Robert and Casella (2011), "A Short History of Markov Chain Monte Carlo".


              The Gibbs sampler is an example of a Markov chain Monte Carlo algorithm. Indeed, it is a special case of the Metropolis-Hastings algorithm. Any algorithm that generates random draws from a distribution $pi(theta)$ by simulating a Markov chain that has $pi(theta)$ as its stationary distribution is a Markov chain Monte Carlo algorithm, and that's exactly what the Gibbs sampler does.






              share|cite|improve this answer

























                up vote
                2
                down vote










                up vote
                2
                down vote









                Go with Wikipedia. Better yet, go with these MCMC researchers:





                • Tierney (1994), "Markov Chains for Exploring Posterior Distributions";


                • Geyer (2011), "Introduction to Markov Chain Monte Carlo";


                • Robert and Casella (2011), "A Short History of Markov Chain Monte Carlo".


                The Gibbs sampler is an example of a Markov chain Monte Carlo algorithm. Indeed, it is a special case of the Metropolis-Hastings algorithm. Any algorithm that generates random draws from a distribution $pi(theta)$ by simulating a Markov chain that has $pi(theta)$ as its stationary distribution is a Markov chain Monte Carlo algorithm, and that's exactly what the Gibbs sampler does.






                share|cite|improve this answer














                Go with Wikipedia. Better yet, go with these MCMC researchers:





                • Tierney (1994), "Markov Chains for Exploring Posterior Distributions";


                • Geyer (2011), "Introduction to Markov Chain Monte Carlo";


                • Robert and Casella (2011), "A Short History of Markov Chain Monte Carlo".


                The Gibbs sampler is an example of a Markov chain Monte Carlo algorithm. Indeed, it is a special case of the Metropolis-Hastings algorithm. Any algorithm that generates random draws from a distribution $pi(theta)$ by simulating a Markov chain that has $pi(theta)$ as its stationary distribution is a Markov chain Monte Carlo algorithm, and that's exactly what the Gibbs sampler does.







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited Nov 30 at 13:13

























                answered Nov 30 at 2:01









                bamts

                633310




                633310






























                    draft saved

                    draft discarded




















































                    Thanks for contributing an answer to Cross Validated!


                    • 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%2fstats.stackexchange.com%2fquestions%2f379508%2fis-gibbs-sampling-an-mcmc-method%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

                    AnyDesk - Fatal Program Failure

                    How to calibrate 16:9 built-in touch-screen to a 4:3 resolution?

                    QoS: MAC-Priority for clients behind a repeater