Lecturer: Lance
Fortnow
Lectures: MWF 1:00-1:50 in Jacobs 586 (Kellogg
Building)
Office Hours: TBA
Description: This course will give a basic introduction
to discrete probability including random variables, expectation, variance and
probabilistic inequalities. We then use these tools to show the existence of
combinatorial objects with certain properties by choosing them at random and
showing the property holds with positive probability, for example Ramsey graphs
with no large clique or independent set.
Prerequisites: A
discrete math course or other course with mathematical proofs. No previous
knowledge of probability will be assumed.
Textbook: The
Probabilistic Method by Alon and Spencer
Updated information on the Northwestern
Courses Blackboard Site. Send email
to the instructor with your netid if you don’t see this course.