Talk:Metropolis-Hastings algorithm
|
|
Hello. A comment on the title -- I've never seen the method in question called by "Metropolis-Hastings Markov Chain Monte Carlo Sampling". A google search finds only two instances of the words in the title ([1] (http://www.fmrib.ox.ac.uk/fslfaq/) and [2] (http://www.fmrib.ox.ac.uk/fsl/feat5/detail.html)), excluding many Wikipedia copies. I think the shorter names "Metropolis-Hastings algorithm" and "Markov chain Monte Carlo" are more common. I'm inclined to rename the article to "Markov chain Monte Carlo" and make "Metropolis-Hastings algorithm" redirect to that. Any comments? Happy editing, Wile E. Heresiarch 22:59, 6 Mar 2004 (UTC)
I think "Markov chain Monte Carlo" is often used for more general class of algorithms, including Metropolis-Hastings and other algorithms. So, it might be better to rename this article "Metropolis-Hastings algorithm". Andris 23:06, 6 Mar 2004 (UTC)
- OK, thanks for your input. I am going to rename the article to "Metropolis-Hastings algorithm" now. Wile E. Heresiarch 03:18, 7 Mar 2004 (UTC)
Shouldn't there be a separate entry for just the Metropolis algorithm? I don't think the extensions by Hastings are widely-known (Google: 34,300 vs. 9,310). 21:18, 26 Aug 2004 (UTC)
- I agree. I am writing an article on the "plain" Metropolis algorithm which I certainly believe to be more commonly used (at least it is in my field). Will add to wikipedia when its a more properly formulated Jackliddle 03:33, 20 Nov 2004 (UTC)