Skip to main content
. 2026 Apr 29;28(5):502. doi: 10.3390/e28050502
Algorithm 2 Bayesian MCMC (NUTS Sampler).
  • Define prior: θ∼Gamma(a1,b1), γ∼Gamma(a2,b2)

  • Define likelihood: L(t,e|θ,γ)

  • Target posterior ∝ likelihood × prior

  • Run NUTS sampler for N iterations with M chains

  • return Posterior samples {θ(i),γ(i)}i=1N