방법 비교

	몬테카를로 시뮬레이션을 위한 분산 감소 기법	Markov Chain Monte Carlo (MCMC)
분야	시뮬레이션	시뮬레이션
계열	Process / pipeline	Process / pipeline
기원 연도	1950s–1980s (technique family)	1953 (Metropolis-Hastings); 1984 (Gibbs)
창시자	Hammersley & Morton (antithetic variates, 1956); Lavenberg & Welch (control variates, 1981); importance sampling roots in Kahn & Marshall (1953)	Metropolis et al. (1953); Gibbs sampler formalised by Geman & Geman (1984)
유형	Simulation variance-reduction technique family	Simulation-based Bayesian inference / numerical integration
원전	Ross, S.M. (2012). Simulation (5th ed.). Academic Press. ISBN: 978-0124158252	Gelman, A., Carlin, J.B., Stern, H.S., Dunson, D.B., Vehtari, A. & Rubin, D.B. (2013). Bayesian Data Analysis (3rd ed.). Chapman & Hall/CRC.
별칭	antithetic variates, control variates, importance sampling, stratified sampling MC	MCMC, Metropolis-Hastings, Gibbs sampling, Markov Zinciri Monte Carlo (MCMC — Metropolis-Hastings, Gibbs)
관련	4	5
요약	Variance reduction techniques are a family of methods that improve the efficiency of Monte Carlo simulation by achieving the same estimation accuracy with fewer random draws. Developed incrementally from the 1950s onward — with antithetic variates attributed to Hammersley and Morton, control variates formalised by Lavenberg and Welch, and importance sampling rooted in Kahn and Marshall — the family includes antithetic variates (AV), control variates (CV), importance sampling (IS), and stratification, each exploiting a different structural property of the target quantity to lower estimator variance without introducing bias.	Markov Chain Monte Carlo (MCMC) is a family of simulation algorithms that constructs a Markov chain whose stationary distribution is the target posterior, enabling Bayesian inference and high-dimensional integral computation that would otherwise be analytically intractable. Pioneered by Metropolis and colleagues in 1953 and extended by Hastings in 1970, MCMC underpins modern Bayesian statistics. The two most widely used variants are Metropolis-Hastings, which proposes moves from a general proposal distribution, and Gibbs sampling, which draws each parameter in turn from its full conditional distribution.