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
MATH-417: Number theory II.b - selected topicsThis year's topic is "Additive combinatorics and applications." We will introduce various methods from additive combinatorics, establish the sum-product theorem over finite fields and derive various a
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-511: Number theory II.a - Modular formsIn this course we will introduce core concepts of the theory of modular forms and consider several applications of this theory to combinatorics, harmonic analysis, and geometric optimization.
EE-110: Logic systems (for MT)Ce cours couvre les fondements des systèmes numériques. Sur la base d'algèbre Booléenne et de circuitscombinatoires et séquentiels incluant les machines d'états finis, les methodes d'analyse et de syn
EE-207: Logic systems (for EL)Ce cours couvre les fondements des systèmes numériques. Sur la base d'algèbre Booléenne et de circuits combinatoires et séquentiels incluant les machines d'états finis, les methodes d'analyse et de sy
MATH-496: Computational linear algebraThis is an introductory course to the concentration of measure phenomenon - random functions that depend on many random variables tend to be often close to constant functions.
MATH-522: Empirical processesFrom prototypical examples of estimators used by statisticians, to more complex nonparametric models, methods and theorems will be taught to study their (non)asymptotic behavior, when defined as mappi
MATH-513: Metric embeddingsThe course aims to introduce the basic concepts and results on metric embeddings, or more precisely on approximate embeddings. This area has been under rapid development since the 90's and it has stro
MATH-467: Probabilistic methods in combinatoricsThe 'probabilistic method' is a fundamental tool in combinatorics. The basic idea is as follows: to prove that an object (for example, graph) with certain properties exists, it suffices to prove that
