Compară metode

	Multilevel MCMC	Algoritmul Metropolis-Hastings
Domeniu	Bayesian	Bayesian
Familie	Bayesian methods	Bayesian methods
Anul apariției	1990s	1953
Autorul original	Gelfand & Smith (sampling-based approach); multilevel extension developed through 1990s Bayesian hierarchical modeling literature	Metropolis et al. (1953); generalised by Hastings (1970)
Tip	Bayesian computational inference	Markov chain Monte Carlo sampler
Sursa seminală	Gelman, A., Carlin, J. B., Stern, H. S., Dunson, D. B., Vehtari, A. & Rubin, D. B. (2013). Bayesian Data Analysis (3rd ed.). CRC Press. ISBN: 978-1439840955	Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953). Equation of state calculations by fast computing machines. The Journal of Chemical Physics, 21(6), 1087–1092.
Denumiri alternative	hierarchical MCMC, multilevel Bayesian sampling, MLMCMC, hierarchical Markov chain Monte Carlo	MH algorithm, M-H algorithm, Metropolis algorithm, Metropolis-Hastings sampler
Înrudite	6	5
Rezumat	Multilevel MCMC applies Markov chain Monte Carlo sampling to hierarchical (multilevel) Bayesian models. It draws samples from the joint posterior of both group-level and population-level parameters simultaneously, propagating uncertainty across levels and enabling inference in clustered or nested data structures where observations within groups share common distributional characteristics.	The Metropolis-Hastings (MH) algorithm is a general-purpose Markov chain Monte Carlo (MCMC) method for drawing samples from any probability distribution whose density can be evaluated up to a normalising constant. Introduced by Metropolis, Rosenbluth, Rosenbluth, Teller, and Teller (1953) in computational physics and generalised by Hastings (1970) to asymmetric proposal distributions, it is the foundational algorithm from which nearly all subsequent MCMC samplers — Gibbs sampling, Hamiltonian Monte Carlo, slice sampling — are derived or can be viewed as special cases.