STATS 102C: Introduction to Monte Carlo Methods
Introduction to Markov chain Monte Carlo (MCMC) algorithms for scientific computing. Generation of random numbers from specific distribution. Rejection sampling and importance sampling and their roles in MCMC. Markov chain theory and convergence properties. Metropolis and Gibbs sampling algorithms. Extensions as simulated tempering. Theoretical understanding of methods and their implementation in concrete computational problems.
4 units, lecture, discussion
Loading...
| YINGNIAN WU | Summer 2022 | 67 | 88.1% (59) |
|---|---|---|---|
| MICHAEL TSIANG | Summer 2025 | 116 | 87.1% (101) |
| QING ZHOU | Fall 2022 | 33 | 81.8% (27) |
| SAMUEL ONYANCHA ONYAMBU | Fall 2025 | 129 | 74.4% (96) |
| MILES SATORI CHEN | Fall 2024 | 84 | 72.6% (61) |
| GUANI WU | Fall 2025 | 90 | 41.1% (37) |
A-range % and grade counts cover only each instructor’s latest recorded term, shown in the "Latest Data From" column, combining all sections for the course. A-range % is the share of recorded letter grades (A+ through F) that are A+, A, or A−. Parentheses show the A-range count over the total letter-grade count. P/NP and incompletes are excluded. Records may be incomplete.
- Available Academic Terms
- Fall 2021 · Summer 2022 · Fall 2022 · Summer 2023 · Fall 2023 · Summer 2024 · Fall 2024 · Summer 2025 · Fall 2025