Probabilistic Combinatorics and Algorithms

4 credits

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.