Metropolis–Hastings algorithm: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)

6 October 2021

18 September 2021

25 July 2021

21 June 2021

9 June 2021

2 June 2021

25 May 2021

15 April 2021

23 March 2021

10 March 2021

16 February 2021

7 February 2021

31 December 2020

16 October 2020

11 September 2020

5 September 2020

1 September 2020

26 June 2020

19 May 2020

18 May 2020

24 April 2020

14 April 2020

9 April 2020

28 March 2020

16 March 2020

27 February 2020

24 February 2020

11 February 2020

  • curprev 17:0817:08, 11 February 2020 129.6.178.27 talk 30,213 bytes −4 Metropolis algorithm does not necessary require symmetric trial proposal probability. While typical canonical ensemble moves may happen to be symmetric for simplicity, biased methods and grand canonical insertion and deletion of particles are not. Thus, Metropolis algorithm does not require this. See 'Understanding molecular simulation' by Frenkel and Smit. The title of this section has (symmetric proposal...) which correctly indicates this discussion only applies to the symmetric case. undo

24 November 2019

13 November 2019

2 November 2019

20 October 2019

17 October 2019

8 October 2019

13 September 2019

(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)