Blog: statistics (5 posts)

Markov chain Monte Carlo Sampling (1)

In this first post of Tweag's four-part series on Markov chain Monte Carlo sampling algorithms, you will learn about why and when to use them and the theoretical underpinnings of this powerful class of sampling methods. We discuss the famous Metropolis-Hastings algorithm and give an intuition on the choice of its free parameters. Interactive Python notebooks invite you to play around with MCMC yourself and thus deepen your understanding of the Metropolis-Hastings algorithm.

Interested in working together?Contact us
See our work
  • Biotech
  • Fintech
  • Autonomous vehicles
  • Open source
About us