MATH 261A. Probabilistic Combinatorics and Algorithms (4 units)
Link to catalog page: https://catalog.ucsd.edu/courses/MATH.html#math261a
Description
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: graduate standing or consent of instructor.
Prerequisite courses
MATH 261A has no prerequisite courses.
Successor courses
MATH 261A is a prerequisite of the following 1 courses: