Monte Carlo Methods Lecture Notes
  • Interactive Apps

Interactive Apps

  • Preface
  • Introduction to Monte Carlo Methods
  • Estimation
    • Estimating \(\pi\)
    • Estimating Integrals
  • Sampling
    • Random Number Generators
    • Discrete Distributions
    • Inverse Transform Sampling
    • Other Distributions
    • Rejection Sampling
    • Gibbs Sampling
    • Metropolis–Hastings Algorithm
  • Variance Reduction Techniques
  • Applications
    • Stochastic Differential Equations
    • Ising Model
    • Bootstrap
  • Advanced Topics
    • Particle Filters
  • Appendices
    • Review of Probability Theory
    • Markov Chains
  • Interactive Apps

Interactive Apps

Explore Monte Carlo methods through interactive visualizations

Each app opens on its own. You’ll find every one of them, with the explanation around it, in the chapter it belongs to – and the Share button on any app gives a link or an <iframe> snippet for embedding it elsewhere.

Estimating π

Scatter points in a square and count how many land inside the circle.

Buffon’s Needle

Drop needles on a ruled floor; the fraction that cross a line estimates π.

Random Walk in a Region

Sample uniformly from a non-convex region with random-walk Metropolis, and tune the step size.

Metropolis–Hastings

A Metropolis chain for the standard normal: trace, rejected proposals and histogram.

Gibbs Sampling

Gibbs sampling a bivariate normal: watch correlation slow the staircase down.

Random Walks on Graphs

Watch a distribution spread over a graph and compare mixing times, bottlenecks and spectral gaps.

No matching items
Markov Chains
 

© 2025 Apurva Nakade. All rights reserved.