MATH 261AProbabilistic Combinatorics and Algorithms
Introduction to the probabilistic method. Combinatorial applications of the linearity of expectation, second moment method, Markov, Chebyschev, and Azuma inequalities, and the local limit lemma. Introduction to the theory of random graphs.
Prerequisites
From the catalog: “graduate standing or consent of instructor.”
Courses that list MATH 261A as a prerequisite (1)
- MATH 261B Probabilistic Combinatorics and Algorithms II