18.419 Seminar in Theoretical Computer Science:
Random Walks and Polynomial-Time Algorithms

TR 11-12:30 in 2-338.

Random walks have long been studied for their mathematical appeal; of late they have also played a crucial role in the discovery of polynomial-time algorithms. We will study the theory of random walks, paying special attention to their geometry and their contribution to sampling, counting, optimization, learning and other algorithmic fields.

A student taking the class for credit will
(1) scribe a lecture
(2) present a lecture
(3) work on an open problem and make a brief presentation of his/her findings.

Office hours: Mon 3-4 in 2-380, Wed 4-5 in NE43-305.

Schedule and Lecture notes.

Template for lecture notes.

Papers for presentation.