всего просмотров: 1218
Оценка читателей: голосов 0
1. Соболь И.М. Численные методы Монте-Карло. М.: Наука, 1973.
2. Rubinstein R.Y., Kroese D.P. Simulation and the Monte Carlo Method. New York: Wiley, 2008.
3. von Neumann J. Various techniques used in connection with random digits // Appl. Math. Ser. / National Bureau of Standards. United States Government Printing Office, Washington, DC, USA, 1951. V. 12. P. 36–38.
4. Metropolis N., Rosenbluth A.W., Rosenbluth M.N., Teller A.H., Teller E. Equation of state calculations by fast computing machines // J. Chem. Phys. 1953. V. 21. No. 6. P. 1087–1092.
5. Chib S., Greenberg E. Understanding the Metropolis–Hastings algorithm // Amer. Statist. 1995. V. 49. No. 4. P. 327–335.
6. Chib S., Jeliazkov I. Marginal likelihood from the Metropolis–Hastings output // J. Amer. Statist. Associat. 2001. V. 96. No. 453. P. 270–281.
7. Geweke J., Tanizaki H. Note on the sampling distribution for the MetropolisHastings algorithm // Commun. Statist. Theory Methods. 2003. V. 32. No. 4. P. 775–789.
8. Minh D. Understanding the Hastings algorithm // Commun. Statist. Simulat. Comput. 2015. V. 44. No. 2. P. 332–349.