COM-512: Networks out of controlThe goal of this class is to acquire mathematical tools and engineering insight about networks whose structure is random, as well as learning and control techniques applicable to such network data.
MATH-230: ProbabilityLe cours est une introduction à la théorie des probabilités. Le but sera d'introduire le formalisme moderne (basé sur la notion de mesure), de lier celui-ci à l'aspect "intuitif" des probabilités mais
MATH-486: Statistical mechanics and Gibbs measuresThis course provides a rigorous introduction to the ideas, methods and results of classical statistical mechanics, with an emphasis on presenting the central tools for the probabilistic description of
MATH-260(a): Discrete mathematicsStudy of structures and concepts that do not require the notion of continuity. Graph theory, or study of general countable sets are some of the areas that are covered by discrete mathematics. Emphasis
CS-450: Algorithms IIA first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a reper
MATH-519: Topics in high-dimensional probabilityThis is a theoretical course about probability in high dimensions. We will look at some mathematical phenomena appearing as the number of random variables grows large - e.g. concentration of measure o
