Print Settings coursedescriptions scheduleinformation

## MATH 230A:Theory of Probability I (STATS 310A)

Mathematical tools: sigma algebras, measure theory, connections between coin tossing and Lebesgue measure, basic convergence theorems. Probability: independence, Borel-Cantelli lemmas, almost sure and Lp convergence, weak and strong laws of large numbers. Large deviations. Weak convergence; central limit theorems; Poisson convergence; Stein's method. Prerequisites: 116, MATH 171.
Terms: Aut | Units: 2-4 | Grading: Letter or Credit/No Credit

## MATH 230B:Theory of Probability II (STATS 310B)

Conditional expectations, discrete time martingales, stopping times, uniform integrability, applications to 0-1 laws, Radon-Nikodym Theorem, ruin problems, etc. Other topics as time allows selected from (i) local limit theorems, (ii) renewal theory, (iii) discrete time Markov chains, (iv) random walk theory,n(v) ergodic theory. Prerequisite: 310A or MATH 230A.
Terms: Win | Units: 2-3 | Grading: Letter or Credit/No Credit

## MATH 234:Large Deviations Theory (STATS 374)

Combinatorial estimates and the method of types. Large deviation probabilities for partial sums and for empirical distributions, Cramer's and Sanov's theorems and their Markov extensions. Applications in statistics, information theory, and statistical mechanics. Prerequisite: MATH 230A or STATS 310. Offered every 2-3 years. http://statweb.stanford.edu/~adembo/large-deviations/
Terms: Spr | Units: 3 | Grading: Letter or Credit/No Credit
Instructors: ; Dembo, A. (PI)

## STATS 310B:Theory of Probability II (MATH 230B)

Conditional expectations, discrete time martingales, stopping times, uniform integrability, applications to 0-1 laws, Radon-Nikodym Theorem, ruin problems, etc. Other topics as time allows selected from (i) local limit theorems, (ii) renewal theory, (iii) discrete time Markov chains, (iv) random walk theory,n(v) ergodic theory. Prerequisite: 310A or MATH 230A.
Terms: Win | Units: 2-3 | Grading: Letter or Credit/No Credit

## STATS 374:Large Deviations Theory (MATH 234)

Combinatorial estimates and the method of types. Large deviation probabilities for partial sums and for empirical distributions, Cramer's and Sanov's theorems and their Markov extensions. Applications in statistics, information theory, and statistical mechanics. Prerequisite: MATH 230A or STATS 310. Offered every 2-3 years. http://statweb.stanford.edu/~adembo/large-deviations/
Terms: Spr | Units: 3 | Grading: Letter or Credit/No Credit
Instructors: ; Dembo, A. (PI)