ACM 117
Probability Theory and Computational Mathematics
This course offers a rigorous introduction to probability theory with applications to computational mathematics. Emphasis is placed on nonasymptotic properties of probability models, rather than classical limit theorems. Topics include measure theory, integration, product measures, probability spaces, random variables and expectation, moments, Lp spaces, orthogonality, independence, concentration inequalities, distances between probability measures, the Berry-Esseen theorem, conditional expectation, and conditioning for Gaussian families.
Topics
- measure theory
- integration
- product measures
- probability spaces
- random variables and expectation
- moments
- Lp spaces
- orthogonality
- independence
- concentration inequalities
- distances between probability measures
- the Berry-Esseen theorem
- conditional expectation
- and conditioning for Gaussian families
Topics explicitly listed in official catalogue description
Prerequisites & course information
Prerequisites: ACM/IDS 104 and ACM/EE/IDS 116; or instructor's permission.
Sources
- Course catalogue ↗2026-2027
- Catalogue entry ↗
Catalogue variants
- Probability Theory and Computational Mathematics · 12 units (3-0-9) | first term