STATS 102C: Introduction to Monte Carlo Methods
Lecture, three hours; discussion, one hour. Requisites: courses 100B (or Mathematics 170S), 102A. 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. P/NP or letter grading.
4 units, upper division
Offered Fall quarters
- Predicted GPA
- 3.36
- A or A minus
- 59%
- D, F or withdrew
- 4%
- Sections
- No sections listed for this term. Offered Fall quarters.
- By instructor
- Fall 2021 to Fall 2025
- All instructors
- 3.36 GPA
- 59% A
- 4% DFW
- 1,303 grades
- WU
- 3.00 GPA
- 38% A
- 8% DFW
- 620 grades
- CHEN
- 3.62 GPA
- 73% A
- 1% DFW
- 223 grades
- TSIANG
- 3.74 GPA
- 84% A
- 1% DFW
- 187 grades
- ONYAMBU
- 3.65 GPA
- 74% A
- 1% DFW
- 129 grades
- ZHOU
- 3.55 GPA
- 69% A
- 0% DFW
- 77 grades
- WU
- 3.70 GPA
- 88% A
- 3% DFW
- 67 grades
- Prerequisites
- Requisites: courses 100B (or Mathematics 170S), 102A.
- Restrictions
- Not read yet
- Grading
- Not read yet
What past students say
Read from 40 reviews, all instructors
No professor is listed for this term yet, so these count the reviews of every professor who has taught it.
- Recommend
- 12 recommend it, 15 advise against
- Teaching
- 15 say clear, 12 unclear
- Exams
- 1 says easy, 4 moderate, 9 hard
- Lectures
- 3 say recorded
- Curve
- 2 say curved, 1 says not curved
- Slides
- 1 says posted, 1 says not posted
- Attendance
- 1 says required
- Textbook
- 1 says needed
Each figure counts the reviews that say so. Most reviews skip most topics.