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
MATH-615: Gaussian free field through random walksIn this lecture series some important objects of random geometry are introduced and studied. In particular, the relation between the Gaussian free field and random walks / Brownian motions is explored
MATH-260(b): 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
